Related papers: Algebraic Obstructions and the Collapse of Element…

The no-(k+1)-in line problem seeks the maximum number of points that can be selected from an $n \times n$ square lattice such that no $k+1$ of them are collinear. The problem was first posed more than $100$ years ago for the special case…

Let $R={\sf k}[x,y,z]$, the polynomial ring over a field $\sf k$. Several of the authors previously classified nets of ternary conics and their specializations over an algebraically closed field. We here show that when $\sf k$ is…

In this paper we show that if for an integer matrix A the universal Gr\"obner basis of the associated toric ideal \Ideal_A coincides with the Graver basis of A, then the Gr\"obner complexity u(A) and the Graver complexity g(A) of its higher…

We give another proof, using tools from Geometric Invariant Theory, of a result due to S. Sam and A. Snowden in 2014, concerning the stability of Kro-necker coefficients. This result states that some sequences of Kronecker coefficients…

Let $r \geq 0$, and let $\lambda$ and $\mu$ be partitions such that $\lambda_1 \leq r + 1$. We present a combinatorial interpretation of the plethysm coefficient $\langle s_\lambda, s_\mu[s_r] \rangle$. As a consequence, we solve the…

We introduce the general polynomial algebras characterizing a class of higher order superintegrable systems that separate in Cartesian coordinates. The construction relies on underlying polynomial Heisenberg algebras and their defining…

Our main goal is to compute the decomposition of arbitrary Kronecker powers of the Harmonics of $S_n$. To do this, we give a new way of decomposing the character for the action of $S_n$ on polynomial rings with $k$ sets of $n$ variables.…

Let V be a smooth projective 3-fold of general type. Denote by $K^3$, a rational number, the self-intersection of the canonical sheaf of any minimal model of V. One defines $K^3$ as the canonical volume of $V$. Assume $p_g\ge 2$. We show…

A seminal result in the theory of toric varieties, due to Knudsen, Mumford and Waterman (1973), asserts that for every lattice polytope $P$ there is a positive integer $k$ such that the dilated polytope $kP$ has a unimodular triangulation.…

The study of extremal problems on triangle areas was initiated in a series of papers by Erd\H{o}s and Purdy in the early 1970s. In this paper we present new results on such problems, concerning the number of triangles of the same area that…

We present a structural resolution to the exact evaluation of the partition function $p_k(n)$, systematically overcoming the limitations of traditional recursive and asymptotic methods. By framing the partition polytope $\mathcal{P}_{n,k}$…

We obtain upper and lower bounds for running times of exponential time algorithms for the detection of weak backdoor sets of 3CNF formulas, considering various base classes. These results include (omitting polynomial factors), (i) a 4.54^k…

We study algebraic complexity classes and their complete polynomials under \emph{homogeneous linear} projections, not just under the usual affine linear projections that were originally introduced by Valiant in 1979. These reductions are…

Due to the elimination property held by the lexicographic monomial order, the corresponding Groebner bases display strong structural properties from which meaningful informations can easily be extracted. We study these properties for…

We describe a large-scale computational experiment to study structure in the numbers of real solutions to osculating instances of Schubert problems. This investigation uncovered Schubert problems whose computed numbers of real solutions…

We show that if $A\subset \{1,\ldots,N\}$ contains no non-trivial three-term arithmetic progressions then $\lvert A\rvert \ll N/(\log N)^{1+c}$ for some absolute constant $c>0$. In particular, this proves the first non-trivial case of a…

In [1] it was shown that the Kochen Specker theorem can be written in terms of the non-existence of global elements of a certain varying set over the partially ordered set of boolean subalgebras of projection operators on some Hilbert…

Our contribution is a bounded cubic compilation theorem. For each fixed resource parameter $k$, syntactic proof checking at resource level $k$ is faithfully represented by a finite bounded-domain system of cubic polynomial equations. Every…

It has been recently proved (by Croot, Lev and Pach and the subsequent work by Ellenberg and Gijswijt) that for a group $G=G_0^n$, where $G_0\ne \{1,-1\}^m$ is a fixed finite Abelian group and $n$ is large, any subset $A$ without…

Multi-way tables with specified marginals arise in a variety of applications in statistics and operations research. We provide a comprehensive complexity classification of three fundamental computational problems on tables: existence,…