Related papers: A note on linear Sperner families
Via a generalization of the pseudospectral method for numerical solution of differential equations, a family of nonlinear algebraic identities satisfied by the zeros of a wide class of orthogonal polynomials is derived. The generalization…
We provide necessary and sufficient conditions for simplicial complexes whose determinantal facet ideals admit reduced Grobner bases under diagonal term orders. Building on and extending foundational results for binomial edge ideals and…
In this paper we study standard bases for submodules of a mixed power series and polynomial ring $R[[t_1,\ldots,t_m]][x_1,\ldots,x_n]^s$ respectively of their localization with respect to a $t$-local monomial ordering for a certain class of…
We generalize the Bernstein-Sato polynomials of Budur, Mustata and Saito to ideals in normal semigroup rings. In the case of monomial ideals, we also relate the roots of the Bernstein-Sato polynomial to the jumping coefficients of the…
We introduce balanced polyominoes and show that their ideal of inner minors is a prime ideal and has a quadratic Gr\"obner basis with respect to any monomial order, and we show that any row or column convex and any tree-like polyomino is…
We prove that any lower unitriangular and totally nonnegative matrix gives rise to a family of polynomials with only real zeros. This has consequences for problems in several areas of mathematics. We use it to develop a general theory for…
Fix any algebraic extension $\mathbb K$ of the field $\mathbb Q$ of rationals. In this article we study exponential sets $V\subset \mathbb R^n$. Such sets are described by the vanishing of so called exponential polynomials, i.e.,…
A set system $\mathcal{F}$ is $t$-\textit{intersecting}, if the size of the intersection of every pair of its elements has size at least $t$. A set system $\mathcal{F}$ is $k$-\textit{Sperner}, if it does not contain a chain of length…
A configuration of lattice vectors is supernormal if it contains a Hilbert basis for every cone spanned by a subset. We study such configurations from various perspectives, including triangulations, integer programming and Groebner bases.…
In this contribution, we consider a zero-dimensional polynomial system in $n$ variables defined over a field $\mathbb{K}$. In the context of computing a Rational Univariate Representation (RUR) of its solutions, we address the problem of…
We define two new families of polynomials that generalize permanents and prove upper and lower bounds on their determinantal complexities comparable to the known bounds for permanents. One of these families is obtained by replacing…
We introduce several notions of `random fewnomials', i.e. random polynomials with a fixed number f of monomials of degree N. The f exponents are chosen at random and then the coefficients are chosen to be Gaussian random, mainly from the…
In this paper we present an algorithm for computing Groebner bases of linear ideals in a difference polynomial ring over a ground difference field. The input difference polynomials generating the ideal are also assumed to be linear. The…
Let X be a standard determinantal scheme X \subset \PP^n of codimension c, i.e. a scheme defined by the maximal minors of a t \times (t+c-1) homogeneous polynomial matrix A. In this paper, we study the main features of its normal sheaf…
We propose an explicit formula for the Segre classes of monomial subschemes of nonsingular varieties, such as schemes defined by monomial ideals in projective space. The Segre class is expressed as a formal integral on a region bounded by…
The "2-variable general-$\lambda$-matrix polynomials (2VG$\lambda$MP)" is a new family of matrix polynomials, introduced and studied in this article. These matrix polynomials are constructed using umbral and symbolic methods. We delve into…
We show that the universal Gr\"obner basis and the Graver basis of a binomial edge ideal coincide. We provide a description for this basis set in terms of certain paths in the underlying graph. We conjecture a similar result for a parity…
We compute the type (maximum linearization) of the well partial order of bounded lower sets in $\mathbb{N}^m$, ordered under inclusion, and find it is $\omega^{\omega^{m-1}}$. Moreover we compute the type of the set of all lower sets in…
In 1938, Skolem conjectured that $\mathbf{SL}_n(\mathbb{Z})$ is not a polynomial family for any $n \ge 2$. Carter and Keller disproved Skolem's conjecture for all $n \ge 3$ by proving that $\mathbf{SL}_n(\mathbb{Z})$ is boundedly generated…
Over a field of characteristic two, we develop a theory of standard monomials for polynomial rings modulo a Frobenius power of the maximal ideal generated by all variables. As a result, we obtain a filtration by modular GL_n-representations…