Related papers: On a generalization of Kelly's combinatorial lemma
Decompositions of the unitary group U(n) are useful tools in quantum information theory as they allow one to decompose unitary evolutions into local evolutions and evolutions causing entanglement. Several recursive decompositions have been…
In this paper we present characterizations of the sets of key polynomials and abstract key polynomials for a valuation $\mu$ of $K(x)$, in terms of (ultrametric) balls in the algebraic closure $\overline K$ of $K$ with respect to $v$, a…
A new probabilistic technique for establishing the existence of certain regular combinatorial structures has been recentlyintroduced by Kuperberg, Lovett, and Peled (STOC 2012). Using this technique, it can be shown that under certain…
Kakutani's fixed point theorem is a generalization of Brouwer's fixed point theorem to upper semicontinuous multivalued maps and is used extensively in game theory and other areas of economics. Earlier works have shown that Sperner's lemma…
We show that a general ordinary Gushel-Mukai(GM) threefold $X$ is reconstructed from the Kuznetsov component $\mathcal{K}u(X)$ together with an extra data coming from tautological sub-bundle of Grassmannian $\mathrm{Gr}(2,5)$. We also prove…
The Tutte polynomial is the most general invariant of matroids and graphs that can be computed recursively by deleting and contracting edges. We generalize this invariant to any class of combinatorial objects with deletion and contraction…
In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of $n$ definable sets belonging to some fixed definable family of sets in an o-minimal structure. This generalizes the…
The generalized Mordell-Lang conjecture (GML) is the statement that the irreducible components of the Zariski closure of a subset of a group of finite rank inside a semi-abelian variety are translates of closed algebraic subgroups. M.…
P. J. Kelly conjectured in 1968 that every diregular tournament on (2n+1) points can be decomposed in directed Hamilton circuits [1]. We define so called leading diregular tournament on (2n+1) points and show that it can be decomposed in…
We study generalized splines from the perspective of the representation theory of the category of graphs with contractions. Our main theorem proves a kind of finite generation, which in turn implies the existence of a ``universal generating…
We define the cluster algebra associated with the Q-system for the Kirillov-Reshetikhin characters of the quantum affine algebra $U_q(\hat{\g})$ for any simple Lie algebra g, generalizing the simply-laced case treated in [Kedem 2007]. We…
The Polynomial Freiman-Ruzsa conjecture is one of the central open problems in additive combinatorics. If true, it would give tight quantitative bounds relating combinatorial and algebraic notions of approximate subgroups. In this note, we…
What might a combinatorial interpretation of the Kronecker coefficients even look like? We introduce a class of combinatorial objects called bitableaux, which we believe are a natural candidate, and we formulate a purely combinatorial…
We deduce Katz's theorems for $(A,B)$-exponential sums over finite fields using $\ell$-adic cohomology and a theorem of Denef-Loeser, removing the hypothesis that $A+B$ is relatively prime to the characteristic $p$. In some degenerate…
We show that every combinatorial model category can be obtained, up to Quillen equivalence, by localizing a model category of diagrams of simplicial sets. This says that any combinatorial model category can be built up from a category of…
In this paper, we study a combinatorial problem originating in the following conjecture of Erdos and Lemke: given any sequence of n divisors of n, repetitions being allowed, there exists a subsequence the elements of which are summing to n.…
For a zero-relation algebra over a field $\mathcal K$, Crawley-Boevey introduced the concept of a tree module and provided a combinatorial description of a basis for the space of homomorphisms between two tree modules--the basis elements…
We present a general framework for carrying out some constructions. The unifying factor is a combinatorial principle which we present in terms of a game in which the first player challenges the second player to carry out constructions which…
Kleene algebra (KA) is an important tool for reasoning about general program equivalences, with a decidable and complete equational theory. However, KA cannot always prove equivalences between specific programs. For this purpose, one adds…
The great innovation of the Generalized Theorem is that it gives us the philosophy to work out the knowledge that the number of roots of an equation depends on the subfields of the functional terms of the equation they generate. Thus, the…