English
Related papers

Related papers: On certain spaces of lattice diagram determinants

200 papers

Let $I,J$ be componentwise linear ideals in a polynomial ring $S$. We study necessary and sufficient conditions for $I+J$ to be componentwise linear. We provide a complete characterization when $\dim S=2$. As a consequence, any…

Commutative Algebra · Mathematics 2025-04-08 Hailong Dao , Sreehari Suresh-Babu

We provide a multidimensional extension of previous results on the existence of polynomial progressions in dense subsets of the primes. Let $A$ be a subset of the prime lattice - the d-fold direct product of the primes - of positive…

Number Theory · Mathematics 2025-04-22 Andrew Lott , Ákos Magyar , Giorgis Petridis , János Pintz

Motivated by applications in robotics and computer vision, we study problems related to spatial reasoning of a 3D environment using sublevel sets of polynomials. These include: tightly containing a cloud of points (e.g., representing an…

Optimization and Control · Mathematics 2017-03-09 Amir Ali Ahmadi , Georgina Hall , Ameesh Makadia , Vikas Sindhwani

We report on the calculation of the inclusive semileptonic decay of the $D_s$ meson on the lattice. We simulate the $D_s \rightarrow X_s\ell\nu_\ell$ process with M\"obius domain-wall charm and strange quarks, whose masses are approximately…

High Energy Physics - Lattice · Physics 2024-12-02 Ryan Kellermann , Alessandro Barone , Ahmed Elgaziari , Shoji Hashimoto , Zhi Hu , Andreas Jüttner , Takashi Kaneko

Let $X$ be an $(m\times n)$-matrix of indeterminates, and let $J$ be the ideal generated by a set $\mathcal{S}$ of maximal minors of $X$. We construct the linear strand of the resolution of $J$. This linear strand is determined by the…

Commutative Algebra · Mathematics 2015-09-01 Jürgen Herzog , Dariush Kiani , Sara Saeedi Madani

A distributive lattice structure ${\mathbf M}(G)$ has been established on the set of perfect matchings of a plane bipartite graph $G$. We call a lattice {\em matchable distributive lattice} (simply MDL) if it is isomorphic to such a…

Combinatorics · Mathematics 2015-03-09 Heping Zhang , Dewu Yang , Haiyuan Yao

We consider a class of lattice paths with certain restrictions on their ascents and down steps and use them as building blocks to construct various families of Dyck paths. We let every building block $P_j$ take on $c_j$ colors and count all…

Combinatorics · Mathematics 2019-05-27 Daniel Birmajer , Juan B. Gil , Peter R. W. McNamara , Michael D. Weiner

Let \( G \) be a graph of order \( n \) with maximum degree $\Delta$, and let $P(G,x)$ denote its chromatic polynomial. We investigate several properties of $P(G,x)$ related to its derivatives and higher-order derivatives. First, we study…

Combinatorics · Mathematics 2026-04-21 Bo Ning , Yan Yang

The domination polynomial of a graph $G$ is given by $D(G,x)=\sum_{k=0}^{n} d_k(G)x^k$ where $d_k(G)$ records the number of $k$-element dominating sets in $G$. A conjecture of Alikhani and Peng asserts that these polynomials have unimodal…

Combinatorics · Mathematics 2026-01-22 Mohamed Omar

Let $K$ be a number field, let $A$ be a finite-dimensional $K$-algebra, let $\mathrm{J}(A)$ denote the Jacobson radical of $A$, and let $\Lambda$ be an $\mathcal{O}_{K}$-order in $A$. Suppose that each simple component of the semisimple…

Number Theory · Mathematics 2022-09-01 Werner Bley , Tommy Hofmann , Henri Johnston

We prove three main results about semialgebraic hypergraphs. First, we prove an optimal and oblivious regularity lemma. Fox, Pach, and Suk proved that the class of $k$-uniform semialgebraic hypergraphs satisfies a very strong regularity…

Combinatorics · Mathematics 2024-11-05 Jonathan Tidor , Hung-Hsun Hans Yu

Lascoux polynomials have been recently introduced to prove polynomiality of the maximum-likelihood degree of linear concentration models. We find the leading coefficient of the Lascoux polynomials (type C) and their generalizations to the…

Algebraic Geometry · Mathematics 2021-07-07 Alessio Borzí , Xiangying Chen , Harshit J. Motwani , Lorenzo Venturello , Martin Vodička

We consider the construction of maximal families of polynomials over the finite field $\mathbb{F}_q$, all having the same degree $n$ and a nonzero constant term, where the degree of the GCD of any two polynomials is $d$ with $1 \le d\le n$.…

Discrete Mathematics · Computer Science 2024-05-15 Maximilien Gadouleau , Luca Mariot , Federico Mazzone

We study the problem of finding Young diagrams of maximum dimension, i. e. those with the largest number of Young tableaux of their shapes. Consider a class of Young diagrams that differ from a symmetric diagram by no more than one box…

Combinatorics · Mathematics 2024-02-14 Vasilii Duzhin , Egor Smirnov-Maltsev

We enumerate the number of monotonic lattice paths starting at $(0,0)$ and terminating at $(m,n)$ in which $l$ of the first $k$ steps lie below the line $y=x\ (0\leq k\leq m\leq n)$. These closed formulas consist of terms which are a…

Combinatorics · Mathematics 2015-08-21 Charles Hoffman , Corey Manack

We show that when we formulate the lattice Boltzmann equation with a small time step $\Delta$t and an associated space scale $\Delta$x, a Taylor expansion joined with the so-called equivalent equation methodology leads to establish…

Numerical Analysis · Mathematics 2018-06-11 François Dubois

We present ongoing investigations of maximally supersymmetric Yang--Mills ($Q = 16$ SYM) theory in three space-time dimensions. At low temperatures and large $N$ this theory is related to black branes in higher-dimensional quantum gravity.…

High Energy Physics - Lattice · Physics 2023-03-27 Angel Sherletov , David Schaich

We show that any $m\times m$ matrix $M$ with integer entries and $\det M =\Delta \neq 0$ can be equipped by a finite digit set $\mathcal{D}\subset\mathbb{Z}^m$ such that any integer $m$-dimensional vector belongs to the set $$ {\rm…

Number Theory · Mathematics 2021-03-04 Edita Pelantová , Tomáš Vávra

We formulate a framework of polynomial diagrams, which are a generalisation of power diagrams (PDs) and anisotropic power diagrams (APDs) allowing for boundaries between cells to be algebraic curves of a prescribed degree. We show that they…

Optimization and Control · Mathematics 2026-05-21 David P. Bourne , Maciej Buze , Thomas Gallouët , Quentin Mérigot

We study the structure of the set of all possible affine hyperplane sections of a convex polytope. We present two different cell decompositions of this set, induced by hyperplane arrangements. Using our decomposition, we bound the number of…

Combinatorics · Mathematics 2025-06-02 Marie-Charlotte Brandenburg , Jesús A. De Loera , Chiara Meroni