Events

Title: When all holes have the same length

Abstract: A hole is an induced cycle of length at least 4. For an integer k ≥ 4, we denote by Ck, the class of graphs where every hole has length k. We have defined a new class of graphs named blowup of ℓ-templates whose all holes have length 2ℓ + 1. Using earlier results on other related classes of graphs, we did obtain the following structural theorem :

Title: Generating k EPR-pairs from an n-party resource state

Abstract: Motivated by quantum network applications over classical channels, we initiate the study of n-party resource states from which LOCC protocols can create EPR-pairs between any k disjoint pairs of parties.

Title: Probabilistic root finding in code-based cryptography

Abstract: Factorization of polynomials over finite fields, and the particular subproblem of finding roots of polynomials, have many applications in diverse areas such as computer algebra, cryptography and coding theory, among many others. In practice, fast factorization algorithms are probabilistic.

Title: Some results on spectral Turán's type problem

Title: Coinvariants and superspace

Title: New Eigenvalue Bound for the Fractional Chromatic Number

Title: From the nabla operator to the super nabla operator

Title: On edge-transitive distance-regular antipodal covers of complete graphs

Title: Nash-Williams Orientation Conjecture for Infinite Graphs       

Abstract: In 1960 Nash-Williams proved that every 2k-edge-connected finite graph admits a k-arc-connected orientation. He conjectured that this is  also true for infinite graphs. We try to prove the conjecture. Joint work with Bruce Richter.

Title: Extended Formulations