Related papers: Determinants, Choices and Combinatorics
In this paper, we give a simple proof of scattering result for the Schr\"odinger equation with combined term $i\pa_tu+\Delta u=|u|^2u-|u|^4u$ in dimension three, that avoids the concentrate compactness method. The main new ingredient is to…
A survey of recent progress in three areas of algebraic combinatorics: (1) the Saturation Conjecture for Littlewood-Richardson coefficients, (2) the n! and (n+1)^{n-1} conjectures, and (3) longest increasing subsequences of permutations.
It is well-known that Choice and Regularity are independent of each other but have important common consequences of logical character (reflection principles, representations of classes by sets, etc.). We explain this phenomenon by isolating…
Given a rank 3 real arrangement $\mathcal A$ of $n$ lines in the projective plane, the Dirac-Motzkin conjecture (proved by Green and Tao in 2013) states that for $n$ sufficiently large, the number of simple intersection points of $\mathcal…
Using ideas from algebraic $K$-theory, we prove that a simple and naturally applicable criterion of Kitaev suffices to trivialize the Fredholm determinant of a multiplicative commutator.
Let R_n be the ring of coinvariants for the diagonal action of the symmetric group S_n. It is known that the character of R_n as a doubly-graded S_n module can be expressed using the Frobenius characteristic map as \nabla e_n, where e_n is…
We present a proof of the compositional shuffle conjecture, which generalizes the famous shuffle conjecture for the character of the diagonal coinvariant algebra. We first formulate the combinatorial side of the conjecture in terms of…
We describe a general construction principle which allows to add colour values to a coupling constant dependent scattering matrix. As a concrete realization of this mechanism we provide a new type of S-matrix which generalizes the one of…
Boij-S\"oderberg theory gives a combinatorial description of the set of Betti tables belonging to finite length modules over the polynomial ring $S = k[x_1, \ldots, x_n]$. We posit that a similar combinatorial description can be given for…
Referring to a standard context of voting theory, and to the classic notion of voting situation, here we show that it is possible to observe any arbitrary set of elections' outcomes, no matter how paradoxical it may appear. On this purpose…
We prove symplectic versions of Suslin's famous $n!$-theorem for algebras over quadratically closed perfect fields of characteristic $\neq 2$ and for algebras over finite fields of characteristic $\neq 2$.
Describing systems in terms of choices and their resulting costs and rewards offers the promise of freeing algorithm designers and programmers from specifying how those choices should be made; in implementations, the choices can be realized…
Tarski gave a general semantics for deductive reasoning: a formula a may be deduced from a set A of formulas iff a holds in all models in which each of the elements of A holds. A more liberal semantics has been considered: a formula a may…
We prove Vojta's generalized abc conjecture for algebraic tori over function fields with exceptional sets that can be determined effectively. Additionally, we establish a version of the conjecture for toric varieties. As an application, we…
We give the graded Cartan determinants of the symmetric groups. Based on it, we propose a gradation of Hill's conjecture which is equivalent to K\"ulshammer-Olsson-Robinson's conjecture on the generalized Cartan invariants of the symmetric…
We study the combinatorics of pseudoline arrangements in the real projective plane. Our focus lies on two classes of arrangements: simplicial arrangements and arrangements whose characteristic polynomials have only real roots. We derive…
For a reduced alternating diagram of a knot with a prime determinant $p,$ the Kauffman-Harary conjecture states that every non-trivial Fox $p$-coloring of the knot assigns different colors to its arcs. In this paper, we prove a…
According to several classical results by Bezout, Sylvester, Cayley, and others, the classical discriminant D_n of degree n polynomials may be expressed as the determinant of a matrix whose entries are much simpler polynomials in the…
In this paper, we obtained an equivalent proposition of Brennan`s conjecture. And given two lower bound estimation of the conjecture one of them connected with Schwarzian derivative. The present study also verified the correctness of the…
We combinatorially prove a new recurrence between the Tutte polynomials of graphs obtained by contraction of the complete graphs $K_{n}$%. This generalizes, to two variables, a relation previously obtained by the author between the…