English
Related papers

Related papers: Plane Partition Polynomial Asymptotics

200 papers

We study the number $p(n,t)$ of partitions of $n$ with difference $t$ between largest and smallest parts. Our main result is an explicit formula for the generating function $P_t(q) := \sum_{n \ge 1} p(n,t) \, q^n$. Somewhat surprisingly,…

Number Theory · Mathematics 2016-05-10 George E. Andrews , Matthias Beck , Neville Robbins

For certain polynomials we relate the number of roots inside the unit circle with the index of a non-degenerate isolated umbilic point on a real analytic surface in Euclidean 3-space. In particular, for $N>0$ we prove that for a certain…

Differential Geometry · Mathematics 2023-09-07 Brendan Guilfoyle , Wilhelm Klingenberg

We give a complete formula for the characteristic polynomial of hyperplane arrangements $\mathcal J_n$ consisting of the hyperplanes $x_i+x_j=1$, $x_k=0$, $x_l=1$, $ 1\leq i, j, k, l\leq n$. The formula is obtained by associating hyperplane…

Combinatorics · Mathematics 2017-01-26 Joungmin Song

We establish an explicit formula for the number $C_n(q)$ of ideals of codimension $n$ of the algebra ${\mathbb F}_q[x,y,x^{-1}, y^{-1}]$ of Laurent polynomials in two variables over a finite field of cardinality $q$. This number is a…

Algebraic Geometry · Mathematics 2020-05-14 Christian Kassel , Christophe Reutenauer

The Gaussian polynomial in variable $q$ is defined as the $q$-analog of the binomial coefficient. In addition to remarkable implications of these polynomials to abstract algebra, matrix theory and quantum computing, there is also a…

Combinatorics · Mathematics 2017-12-21 Ivica Martinjak , Ivana Zubac

The polytope of integer partitions of $n$ is the convex hull of the corresponding $n$-dimensional integer points. Its vertices are of importance because every partition is their convex combination. Computation shows intriguing features of…

Combinatorics · Mathematics 2018-10-04 Vladimir A. Shlyk

We establish asymptotic upper bounds on the number of zeros modulo $p$ of certain polynomials with integer coefficients, with $p$ prime numbers arbitrarily large. The polynomials we consider have degree of size $p$ and are obtained by…

Number Theory · Mathematics 2022-01-19 Amit Ghosh , Kenneth Ward

Consider a random polynomial $$ G_Q(x)=\xi_{Q,n}x^n+\xi_{Q,n-1}x^{n-1}+...+\xi_{Q,0} $$ with independent coefficients uniformly distributed on $2Q+1$ integer points $\{-Q, ..., Q\}$. Denote by $D(G_Q)$ the discriminant of $G_Q$. We show…

Number Theory · Mathematics 2015-01-29 Friedrich Götze , Dmitry Zaporozhets

A partition of degree $n$ is a decomposition $n=i_1+i_2+\dots+i_q$, where ${i_1,i_2,\dots,i_q}$ are positive integers called the parts of the partition. Let $\lambda>0$ be an integer. The partition is said to be a $\lambda$--partition if…

Combinatorics · Mathematics 2017-03-22 F. V. Weinstein

For $G=G_{n, 1/2}$, the Erd\H{o}s--Renyi random graph, let $X_n$ be the random variable representing the number of distinct partitions of $V(G)$ into sets $A_1, \ldots, A_q$ so that the degree of each vertex in $G[A_i]$ is divisible by $q$…

Combinatorics · Mathematics 2022-11-23 Paul Balister , Emil Powierski , Alex Scott , Jane Tan

Cubic and quartic non-autonomous differential equations with continuous piecewise linear coefficients are considered. The main concern is to find the maximum possible multiplicity of periodic solutions. For many classes, we show that the…

Classical Analysis and ODEs · Mathematics 2010-10-01 Mohamad Ali Alwash

The quantum integer [n]_q is the polynomial 1 + q + q^2 + ... + q^{n-1}, and the sequence of polynomials { [n]_q }_{n=1}^{\infty} is a solution of the functional equation f_{mn}(q) = f_m(q)f_n(q^m). In this paper, semidirect products of…

Number Theory · Mathematics 2007-05-23 Melvyn B. Nathanson

We obtain nontrivial estimates of quadratic character sums of division polynomials $\Psi_n(P)$, $n=1,2, ...$, evaluated at a given point $P$ on an elliptic curve over a finite field of $q$ elements. Our bounds are nontrivial if the order of…

Number Theory · Mathematics 2014-12-30 Igor E Shparlinski , Katherine E. Stange

We study the asymptotic distribution of roots of Lommel polynomials as polynomials of the order with a variable and purely imaginary argument. The roots are complex and accumulate on certain curves in the complex plane. We prove existence…

Classical Analysis and ODEs · Mathematics 2021-02-02 Petr Blaschke , František Štampach

An integer-valued multiplicative function $f$ is said to be polynomially-defined if there is a nonconstant separable polynomial $F(T)\in \mathbb{Z}[T]$ with $f(p)=F(p)$ for all primes $p$. We study the distribution in coprime residue…

Number Theory · Mathematics 2023-05-31 Paul Pollack , Akash Singha Roy

We present a study of three families of Kronecker coefficients, which we describe in terms of reduced Kronecker coefficients. This study is grounded on the generating function of the coefficients, proved by a bijection between two…

Combinatorics · Mathematics 2016-04-05 L. Colmenarejo

We present an asymptotic formula for the number of line segments connecting q+1 points of an nxn square grid, and a sharper formula, assuming the Riemann hypothesis. We also present asymptotic formulas for the number of lines through at…

Number Theory · Mathematics 2012-05-16 Pentti Haukkanen , Jorma K. Merikoski

In the paper we partially solved the problem of the distribution of the discriminants of integral polynomials in the cubic case. We proved the asymptotic formula for the number of integral cubic polynomials having bounded height and bounded…

Number Theory · Mathematics 2014-11-17 D. Kaliada , F. Götze , O. Kukso

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 prove new formulas and congruences for $p(n,k):=$ the number of partitions of $n$ into $k$ parts and $q(n,k):=$ the number of partitions of $n$ into $k$ distinct parts. Also, we give lower and upper bounds for the density of the set…

Combinatorics · Mathematics 2024-05-01 Mircea Cimpoeas
‹ Prev 1 8 9 10 Next ›