Related papers: Fourier growth of structured $\mathbb{F}_2$-polyno…

We study the recurrence coefficients of the monic polynomials $P_n(z)$ orthogonal with respect to the deformed (also called semi-classical) Freud weight \begin{equation*} w_{\alpha}(x;s,N)=|x|^{\alpha}{\rm…

In the first, mostly expository, part of this paper, a graded Lie algebra is associated to every group G given with an N-series of subgroups. The asymptotics of the Poincare series of this algebra give estimates on the growth of the group…

In this paper we shall consider the assymptotic growth of $|P_n(z)|^{1/k_n}$ where $P_n(z)$ is a sequence of entire functions of genus zero. Our results extend a result of J. Muller and A. Yavrian. We shall prove that if the sequence of…

In this paper, we study the growth of transcendental entire solutions of linear difference equations \begin{equation} P_m(z)\Delta^mf(z)+\cdots+P_1(z)\Delta f(z)+P_0(z)f(z)=0,\tag{+} \end{equation} where $P_j(z)$ are polynomials for…

Consider a system F of n polynomials in n variables, with a total of n+k distinct exponent vectors, over any local field L. We discuss conjecturally tight bounds on the maximal number of non-degenerate roots F can have over L, with all…

We develop a new algorithm for factoring a bivariate polynomial $F\in \mathbb{K}[x,y]$ which takes fully advantage of the geometry of the Newton polygon of $F$. Under a non degeneracy hypothesis, the complexity is…

A trigonometric series strongly bounded at two points and with coefficients forming a log-quasidecreasing sequence is necessarily the Fourier series of a function belonging to all $L^{p}$ spaces, $1\leq p < \infty$. We obtain new results on…

We prove new lower bounds on the maximum size of subsets $A\subseteq \{1,\dots,N\}$ or $A\subseteq \mathbb{F}_p^n$ not containing three-term arithmetic progressions. In the setting of $\{1,\dots,N\}$, this is the first improvement upon a…

Let $F(p)$, $p\ge2$ be the family of generalized Thompson's groups. Here F(2) is the famous Richard Thompson's group usually denoted by $F$. We find the growth rate of the monoid of positive words in $F(p)$ and show that it does not exceed…

We study the structure of the Fourier coefficients of low degree multivariate polynomials over finite fields. We consider three properties: (i) the number of nonzero Fourier coefficients; (ii) the sum of the absolute value of the Fourier…

We give a structural description of the finite subsets $A$ of an arbitrary group $G$ which obey the polynomial growth condition $|A^n| \leq n^d |A|$ for some bounded $d$ and sufficiently large $n$, showing that such sets are controlled by…

Given a finite set of points $S\subset\mathbb{R}^d$, a $k$-set of $S$ is a subset $A \subset S$ of size $k$ which can be strictly separated from $S \setminus A $ by a hyperplane. Similarly, a $k$-facet of a point set $S$ in general position…

Two polynomials $F_k(X_1,\dots,X_k)$ and $\Theta_k(X_1,\dots,X_k)$ over $\Bbb F_2$ arose from the study of a conjecture by C. Carlet about the sum-freedom of the multiplicative inverse function of $\Bbb F_{2^n}$. Both $F_k$ and $\Theta_k$…

A.Regev proved that the codimension growth of an associative PI-algebra is at most exponential. The author established a scale for the codimension growth of Lie PI-algebras, which includes a series of functions between exponential and…

In this work we analyze basic properties of Random Apollonian Networks \cite{zhang,zhou}, a popular stochastic model which generates planar graphs with power law properties. Specifically, let $k$ be a constant and $\Delta_1 \geq \Delta_2…

A common tool in the theory of numerical semigroups is to interpret a desired class of semigroups as the integer lattice points in a rational polyhedron in order to leverage computational and enumerative techniques from polyhedral geometry.…

We show that the problem of finding the measure supported on a compact subset K of the complex plane such that the variance of the least squares predictor by polynomials of degree at most n at a point exterior to K is a minimum, is…

Choose a polynomial $f$ uniformly at random from the set of all monic polynomials of degree $n$ with integer coefficients in the box $[-L,L]^n$. The main result of the paper asserts that if $L=L(n)$ grows to infinity, then the Galois group…

Reidl, S\'anchez Villaamil, and Stravopoulos (2019) characterized graph classes of bounded expansion as follows: A class $\mathcal{C}$ closed under subgraphs has bounded expansion if and only if there exists a function $f:\mathbb{N} \to…

We present a structural resolution to the exact evaluation of the partition function $p_k(n)$, systematically overcoming the limitations of traditional recursive and asymptotic methods. By framing the partition polytope $\mathcal{P}_{n,k}$…