English
Related papers

Related papers: Multiple recurrence for non-commuting transformati…

200 papers

We present some Euler-type recurrences for the partition function $p(n)$.

Combinatorics · Mathematics 2018-11-26 Yuriy Choliy , Louis W. Kolitsch , Andrew V. Sills

Let $p$ be a polynomial in the non-commuting variables $(a,x)=(a_1,...,a_{g_a},x_1,...,x_{g_x})$. If $p$ is convex in the variables $x$, then $p$ has degree two in $x$ and moreover, $p$ has the form $p = L + \Lambda ^T \Lambda,$ where $L$…

Functional Analysis · Mathematics 2008-04-07 Damon M. Hay , J. William Helton , Adrian Lim , Scott McCullough

Deciding the positivity of a sequence defined by a linear recurrence and initial conditions is, in general, a hard problem. When the coefficients of the recurrences are constants, decidability has only been proven up to order 5. The…

Symbolic Computation · Computer Science 2025-03-19 Alaa Ibrahim

We consider the equation R(n)=Q(n)+M(n) R(n-1), with random non-i.i.d. coefficients (Q(n),M(n)), and show that the distribution tails of the stationary solution to this equation are regularly varying at infinity.

Probability · Mathematics 2010-06-15 A. P. Ghosh , D. Hay , V. Hirpara , R. Rastegar , A. Roitershtein , A. Schulteis , J. Suh

Given two polynomials $P(\underline x)$, $Q(\underline x)$ in one or more variables and with integer coefficients, how does the property that they are coprime relate to their values $P(\underline n), Q(\underline n)$ at integer points…

Number Theory · Mathematics 2022-09-30 Arnaud Bodin , Pierre Dèbes

We show that for a random polynomial \[ F(X) = \sum_{n=1}^{N} f(n) X^{n-1}, \] where $f(n)$ is a random completely multiplicative function taking values in $\{\pm 1\}$, one has \[ \limsup_{N \to \infty} \mathbb{P}\big[F(X) \text{ is…

Number Theory · Mathematics 2025-11-19 Oleksiy Klurman , Vlad Matei

A random number of items each independently marked with one of a collection of colours gives rise to the multinomial marking, which generalises binomial thinning. A multivariate version, where previously marked items are then re-marked, has…

Probability · Mathematics 2025-11-19 Matthew Aldridge

We study the probability that a random polynomial with integer coefficients is reducible when factored over the rational numbers. Using computer-generated data, we investigate a number of different models, including both monic and non-monic…

We introduce the ratio of the number of roots of a polynomial $P_{d}$, less than one in modulus, to its degree $d$ as an alternative to Mahler measure. We investigate some properties of the alternative. We generalise this definition for a…

Number Theory · Mathematics 2025-02-06 Dragan Stankov

In this paper, we determine the bifurcation set of a real polynomial function of two variables for non-degenerate case in the sense of Newton polygons by using a toric compactification. We also count the number of singular phenomena at…

Geometric Topology · Mathematics 2016-08-10 Masaharu Ishikawa , Tat Thang Nguyen , Tien Son Pham

In this thesis we study convolutions that arise from noncommutative probability theory. We prove several regularity results for free convolutions, and for measures in partially defined one-parameter free convolution semigroups. We discuss…

Operator Algebras · Mathematics 2007-05-23 Serban Teodor Belinschi

In this paper we construct an entire function of two variables having the property that its values and its partial derivatives of any order at any distinct algebraic points are algebraically independent. Such an entire function is generated…

Number Theory · Mathematics 2019-08-20 Haruki Ide

We study existence and computability of finite bases for ideals of polynomials over infinitely many variables. In our setting, variables come from a countable logical structure A, and embeddings from A to A act on polynomials by renaming…

Logic in Computer Science · Computer Science 2026-05-21 Arka Ghosh , Sławomir Lasota

We consider orthogonal polynomials $\{p_{n,N}(x)\}_{n=0}^{\infty}$ on the real line with respect to a weight $w(x)=e^{-NV(x)}$ and in particular the asymptotic behaviour of the coefficients $a_{n,N}$ and $b_{n,N}$ in the three term…

Classical Analysis and ODEs · Mathematics 2010-07-30 A. B. J. Kuijlaars , P. M. J. Tibboel

We show that polynomial-time randomness (p-randomness) is preserved under a variety of familiar operations, including addition and multiplication by a nonzero polynomial-time computable real number. These results follow from a general…

Computational Complexity · Computer Science 2012-03-01 Stephen A. Fenner

We obtain various irreducibility criteria for pairs of polynomials $(f(X),g(X))$ with integer coefficients whose resultant $Res(f,g)$ is a prime number, or is divisible by a sufficiently large prime number, and also for some of their linear…

Number Theory · Mathematics 2025-04-25 Nicolae Ciprian Bonciocat

We introduce a sequence $P_{2n}$ of monic reciprocal polynomials with integer coefficients having the central coefficients fixed. We prove that the ratio between number of nonunimodular roots of $P_{2n}$ and its degree $d$ has a limit when…

Number Theory · Mathematics 2019-10-23 Dragan Stankov

The multi-point Taylor polynomial, which is the general, unique and of minimum degree ($mk+m-1$) polynomial $P_{k,m}(x)$ which interpolates a function's derivatives in multiple points is presented in its explicit form. A proof that this…

Classical Analysis and ODEs · Mathematics 2021-06-23 Andrés Gómez Arias

In this paper, we show that the difference between the number of parts in the odd partitions of $n$ and the number of parts in the distinct partitions of $n$ satisfies Euler's recurrence relation for the partition function $p(n)$ when $n$…

Combinatorics · Mathematics 2020-05-08 Mircea Merca

To cater to the needs of (Zero Knowledge) proofs for (mathematical) proofs, we describe a method to transform formal sentences in 2x2-matrices over multivariate polynomials with integer coefficients, such that usual proof-steps like…

Logic · Mathematics 2025-09-17 Mihai Prunescu