English
Related papers

Related papers: Equidistribution and partition polynomials

200 papers

Given a numerical semigroup $S$, we let $\mathrm P_S(x)=(1-x)\sum_{s\in S}x^s$ be its semigroup polynomial. We study cyclotomic numerical semigroups; these are numerical semigroups $S$ such that $\mathrm P_S(x)$ has all its roots in the…

Number Theory · Mathematics 2020-08-27 Emil-Alexandru Ciolan , Pedro A. García-Sánchez , Pieter Moree

We propose a criterion of equidistribution by the differentiability of certain arithmetic invariants. Combined with the slope method and the asymptotic measures, this criterion gives a new "conceptual" proof to equidistribution results…

Algebraic Geometry · Mathematics 2008-12-19 Huayi Chen

We present a polynomial partitioning theorem for finite sets of points in the real locus of an irreducible complex algebraic variety of codimension at most two. This result generalizes the polynomial partitioning theorem on the Euclidean…

Algebraic Geometry · Mathematics 2015-09-22 Saugata Basu , Martin Sombra

We prove a theorem which add a new member to Rogers-Ramanujan identities. This new member counts partitions with different type of constraints on even and odd parts. Generalizing this theorem, we obtain two family of partition identities of…

Algebraic Geometry · Mathematics 2021-11-11 Pooneh Afsharijoo

A classical result of MacMahon states that inversion number and major index have the same distribution over permutations of a given multiset. In this work we prove a strengthening of this theorem originally conjectured by Haglund. Our…

Combinatorics · Mathematics 2015-08-26 Andrew Timothy Wilson

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…

Symbolic Computation · Computer Science 2017-04-14 Victor Y. Pan , Liang Zhao

We prove effective equidistribution theorems, with polynomial error rate, for orbits of the unipotent subgroups of $\operatorname{SL}_2(\mathbb R)$ in arithmetic quotients of $\operatorname{SL}_2(\mathbb C)$ and $\operatorname{SL}_2(\mathbb…

Dynamical Systems · Mathematics 2022-07-29 Elon Lindenstrauss , Amir Mohammadi , Zhiren Wang

This manuscript is intended as an accompaniment to Guth's "A restriction estimate using polynomial partitioning". We begin by summarizing the core ideas of the proof, elaborating the history and development of the techniques therein. From…

Classical Analysis and ODEs · Mathematics 2024-02-07 John Green , Terry Harris , Kaiyi Huang , Arian Nadjimzadah

We consider properties of polynomials with coefficients in division rings. A theorem on the decomposition of a polynomial with coefficients in an arbitrary division ring is obtained. It is shown that if a non-central element is not a root…

Rings and Algebras · Mathematics 2025-09-05 Alina G. Goutor , Sergey V. Tikhonov

The multiple root loci among univariate polynomials of degree $n$ are indexed by partitions of $n$. We study these loci and their conormal varieties. The projectively dual varieties are joins of such loci where the partitions are hooks. Our…

Algebraic Geometry · Mathematics 2015-10-26 Hwangrae Lee , Bernd Sturmfels

This paper is devoted to the study of equidistributional properties of \textit{totient points} in $\mathbb{N}^r$, that is, of coprime $r$-tuples of integers, with particular emphasis on some relevant sets of totient points fulfilling extra…

Number Theory · Mathematics 2013-10-15 José L. Fernández , Pablo Fernández

In this paper, we generalize Bernoulli-Goss polynomials, and give a criterion on the divisibility of zeta functions of cyclotomic function fields. As an application of our criterion, for a given polynomial $f(u)$, we prove that there are…

Number Theory · Mathematics 2018-08-22 Daisuke Shiomi

We study equidistribution problem of zeros in relation to a sequence of $Z$-asymptotically Chebyshev polynomials on $\mathbb{C}^{m}$. We use certain results obtained in a very recent work of Bayraktar, Bloom and Levenberg and have an…

Complex Variables · Mathematics 2025-01-29 Ozan Günyüz

Let $N(\leq m,n)$ denote the number of partitions of $n$ with rank not greater than $m$, and let $M(\leq m,n)$ denote the number of partitions of $n$ with crank not greater than $m$. Bringmann and Mahlburg observed that $N(\leq m,n)\leq…

Combinatorics · Mathematics 2017-04-05 William Y. C. Chen , Kathy Q. Ji , Wenston J. T. Zang

Given a partition $\lambda$, we write $e_j(\lambda)$ for the $j^{\textrm{th}}$ elementary symmetric polynomial $e_j$ evaluated at the parts of $\lambda$ and $e_jp_A(n)$ for the sum of $e_j(\lambda)$ as $\lambda$ ranges over the set of…

Combinatorics · Mathematics 2024-08-27 Cristina Ballantine , George Beck , Mircea Merca

This paper gives an exposition of well known results on vector partition functions. The exposition is based on works of M. Brion, A. Szenes and M. Vergne and is geared toward explicit computer realizations. In particular, the paper presents…

Representation Theory · Mathematics 2010-11-25 Todor Milev

A partition polynomial is a refinement of the partition number p(n) whose coefficients count some special partition statistic. Just as partition numbers have useful asymptotics so do partition polynomials. In fact, their asymptotics…

Combinatorics · Mathematics 2021-11-25 Robert P. Boyer , Daniel Parry

We derive recursive and direct formulas for the interweight distribution of an equitable partition of a hypercube. The formulas involve a three-variable generalization of the Krawtchouk polynomials. Keywords: equitable partition; regular…

Combinatorics · Mathematics 2014-08-04 Denis Krotov

Schur's transforms of a polynomial are used to count its roots in the unit disk. These are generalized them by introducing the sequence of symmetric sub-resultants of two polynomials. Although they do have a determinantal definition, we…

Symbolic Computation · Computer Science 2007-05-23 Cyril Brunie , Philippe Saux Picart

We introduce a universal approach for applying the partition rank method, an extension of Tao's slice rank polynomial method, to tensors that are not diagonal. This is accomplished by generalizing Naslund's distinctness indicator to what we…

Combinatorics · Mathematics 2024-09-18 Mohamed Omar