English
Related papers

Related papers: Polynomial partitioning for a set of varieties

200 papers

We construct type A partially-symmetric Macdonald polynomials $P_{(\lambda \mid \gamma)}$, where $\lambda \in \mathbb{Z}_{\geq 0}^{n-k}$ is a partition and $\gamma \in \mathbb{Z}_{\geq 0}^k$ is a composition. These are polynomials which are…

Combinatorics · Mathematics 2023-12-20 Ben Goodberry

Consider a system of polynomials in many variables over the ring of integers of a number field $K$. We prove an asymptotic formula for the number of integral zeros of this system in homogeneously expanding boxes. As a consequence, any…

Number Theory · Mathematics 2019-02-20 Christopher Frei , Manfred Madritsch

For a given monic polynomial $p(t)$ of degree $n$ over a commutative ring $k$, the splitting algebra is the universal $k$-algebra in which $p(t)$ has $n$ roots, or, more precisely, over which $p(t)$ factors, $p(t)=(t-\xi_1)...(t-\xi_n)$.…

Commutative Algebra · Mathematics 2011-05-24 Anders Thorup

For $\ell\geq 2$ and $h\in \mathbb{Z}[x_1,\dots,x_{\ell}]$ of degree $k\geq 2$, we show that every set $A\subseteq \{1,2,\dots,N\}$ lacking nonzero differences in $h(\mathbb{Z}^{\ell})$ satisfies $|A|\ll_h Ne^{-c(\log N)^{\mu}}$, where…

Number Theory · Mathematics 2021-09-07 John R. Doyle , Alex Rice

We show that the reduced point variety of a quantum polynomial algebra is the union of specific linear subspaces in $\mathbb{P}^n$, we describe its irreducible components and give a combinatorial description of the possible configurations…

Rings and Algebras · Mathematics 2016-07-14 Pieter Belmans , Kevin De Laet , Lieven Le Bruyn

This paper deals with properties of the algebraic variety defined as the set of zeros of a "typical" sequence of polynomials. We consider various types of "nice" varieties: set-theoretic and ideal-theoretic complete intersections,…

Number Theory · Mathematics 2015-12-18 Joachim von zur Gathen , Guillermo Matera

We obtain a polynomial upper bound in the finite-field version of the multidimensional polynomial Szemer\'{e}di theorem for distinct-degree polynomials. That is, if $P_1, ..., P_t$ are nonconstant integer polynomials of distinct degrees and…

Number Theory · Mathematics 2021-11-10 Borys Kuca

Let $G$ be a connected, absolutely almost simple, algebraic group defined over a finitely generated, infinite field $K$, and let $\Gamma$ be a Zariski dense subgroup of $G(K)$. We show, apart from some few exceptions, that the…

Number Theory · Mathematics 2015-08-07 Supriya Pisolkar , C. S. Rajan

Let $X \subseteq \mathbb{P}^n, n \geq 4$ be a codimension-two subcanonical local complete intersection variety with ideal sheaf $\mathcal{I}_X$. Let $a_X \in \mathbb{Z}$ be such that $\omega_X = \mathscr{O}_X(a_X)$. Assume that there exists…

Commutative Algebra · Mathematics 2025-12-16 Manoj Kummini , Abhiram Subramanian

Let $P$ be a set of $n$ points on the plane in general position. We say that a set $\Gamma$ of convex polygons with vertices in $P$ is a convex decomposition of $P$ if: Union of all elements in $\Gamma$ is the convex hull of $P,$ every…

Computational Geometry · Computer Science 2012-07-19 Mario Lomeli-Haro

{\em Partial domination problem} is a generalization of the {\em minimum dominating set problem} on graphs. Here, instead of dominating all the nodes, one asks to dominate at least a fraction of the nodes of the given graph by choosing a…

Computational Geometry · Computer Science 2025-05-23 Madhura Dutta , Anil Maheshwari , Subhas C. Nandy , Bodhayan Roy

Let $k$ be a field and $V$ an $k$-vector space. For a family $\bar P=\{ P_i\}_{1\leq i\leq c}, $ of polynomials on $V$, we denote by $\mathbb X _{\bar P}\subset V$ the subscheme defined by the ideal generated by $ \bar P$. We show the…

Algebraic Geometry · Mathematics 2020-05-27 David Kazhdan , Tamar Ziegler

As a generalization of the concept of the partition dimension of a graph, this article introduces the notion of the $k$-partition dimension. Given a nontrivial connected graph $G=(V,E)$, a partition $\Pi$ of $V$ is said to be a…

Combinatorics · Mathematics 2018-09-18 Alejandro Estrada-Moreno

In this article, we construct explicit examples of pairs of non-isomorphic trees with the same restricted $U$-polynomial for every $k$; by this we mean that the polynomials agree on terms with degree at most $k+1$. The main tool for this…

Combinatorics · Mathematics 2020-02-20 José Aliste-Prieto , Anna de Mier , José Zamora

Let $G$ be an $r$-uniform hypergraph on $n$ vertices such that all but at most $\varepsilon \binom{n}{\ell}$ $\ell$-subsets of vertices have degree at least $p \binom{n-\ell}{r-\ell}$. We show that $G$ contains a large subgraph with high…

Combinatorics · Mathematics 2018-04-17 Victor Falgas-Ravry , Allan Lo

A celebrated theorem of Shoda states that over any field K (of characteristic 0), every matrix with trace 0 can be expressed as a commutator AB-BA, or, equivalently, that the set of values of the polynomial f(x,y)=xy-yx on the nxn-matrix…

Rings and Algebras · Mathematics 2013-11-26 Zachary Mesyan

Let $\Gamma$ be a $Q$-polynomial distance-regular graph with diameter at least $3$. Terwilliger (1993) implicitly showed that there exists a polynomial, say $T(\lambda)\in \mathbb{C}[\lambda]$, of degree $4$ depending only on the…

Combinatorics · Mathematics 2014-03-18 Alexander L. Gavrilyuk , Jack H. Koolen

We consider the algebra of invariants of $d$-tuples of $n\times n$ matrices under the action of the orthogonal group by simultaneous conjugation over an infinite field of characteristic $p$ different from two. It is well-known that this…

Rings and Algebras · Mathematics 2021-11-16 Artem Lopatin

We prove Odoni's conjecture in all prime degrees; namely, we prove that for every positive prime $p$, there exists a degree $p$ polynomial $\varphi\in\mathbb{Z}[x]$ with surjective arboreal Galois representation. We also show that Vojta's…

Number Theory · Mathematics 2018-12-19 Nicole R. Looper

A degree-$d$ polynomial $p$ in $n$ variables over a field $\F$ is {\em equidistributed} if it takes on each of its $|\F|$ values close to equally often, and {\em biased} otherwise. We say that $p$ has a {\em low rank} if it can be expressed…

Combinatorics · Mathematics 2008-07-02 Tali Kaufman , Shachar Lovett