Related papers: Extremal problems for trinomials with fold symmetr…

Let $T:= T(A, {\mathcal D})$ be a disk-like self-affine tile generated by an integral expanding matrix $A$ and a consecutive collinear digit set ${\mathcal D}$, and let $f(x)=x^{2}+px+q$ be the characteristic polynomial of $A$. In the…

We examine the asymptotic expansion of the Touchard polynomials $T_n(z)$ (also known as the exponential polynomials) for large $n$ and complex values of the variable $z$. In our treatment $|z|$ may be finite or allowed to be large like…

In the present paper we consider $F_k(x)=x^{k}-\sum_{t=0}^{k-1}x^t,$ the characteristic polynomial of the $k$-th order Fibonacci sequence, the latter denoted $G(k,l).$ We determine the limits of the real roots of certain odd and even degree…

For an appropriate class of convex functions $\phi$, we study the Fourier extension operator on the surface $\{(y, |y|^2+\phi(y)):y\in\mathbb{R}^2\}$ equipped with projection measure. For the corresponding extension inequality, we compute…

We study some approximation problems on a strict subset of the circle by analytic functions of the Hardy space H2 of the unit disk (in C), whose modulus satisfy a pointwise constraint on the complentary part of the circle. Existence and…

The Krzy\.z conjecture concerns the largest values of the Taylor coefficients of a non-vanishing analytic function bounded by one in modulus in the unit disk. It has been open since 1968 even though information on the structure of extremal…

We find all polynomials $Z(z)$ such that the differential equation $${X(z)\frac{d^2}{dz^2}+Y(z)\frac{d}{dz}+Z(z)}S(z)=0,$$ where $X(z), Y(z), Z(z)$ are polynomials of degree at most 4, 3, 2 respectively, has polynomial solutions…

The extremal functional method determines approximate solutions to the constraints of crossing symmetry, which saturate bounds on the space of unitary CFTs. We show that such solutions are characterized by extremality conditions, which may…

The three sphere partition function, Z, of three dimensional theories with four supercharges and an R-symmetry is computed using localization, resulting in a matrix integral over the Cartan of the gauge group. There is a family of couplings…

Let $f,g_1,\dots,g_m$ be polynomials of degree at most $d$ with real coefficients in a vector of variables $x=(x_1,\dots,x_n)$. Assume that $f$ is non-negative on a basic semi-algebraic set $S$ defined by polynomial inequalities $g_j(x)\ge…

Let $K$ be a field and $S=K[x_1,\ldots,x_n]$, the ring of polynomials in $n$ variables, over $K$. Using the fact that the Hilbert depth is an upper bound for the Stanley depth of a quotient of squarefree monomial ideals $0\subset…

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…

In this paper, we establish transcendental entire function $A(z)$ and polynomial $B(z)$ such that the differential equation $f''+A(z)f'+B(z)f=0$, has all non-trivial solution of infinite order. We use the notion of \emph{critical rays} of…

We evaluate the number of monic polynomials (of arbitrary degree $N$) the zeros of which equal their coefficients when these are allowed to take arbitrary complex values. In the following, we call polynomials with this property {\em…

We use the formalism of the R{\'e}nyi entropies to establish the symmetry range of extremal functions in a family of subcriti-cal Caffarelli-Kohn-Nirenberg inequalities. By extremal functions we mean functions which realize the equality…

We consider incomplete exponential sums in several variables of the form S(f,n,m) = \frac{1}{2^n} \sum_{x_1 \in \{-1,1\}} ... \sum_{x_n \in \{-1,1\}} x_1 ... x_n e^{2\pi i f(x)/p}, where m>1 is odd and f is a polynomial of degree d with…

Let K be a field and S a polynomial ring in a finite number of variables over K. Let F be a finitely generated graded free S-module. We examine some classes of squarefree monomial submodules of F. Hence, we focalize our attention on the…

Motion polynomials are a specific type of polynomial over a Clifford algebra that can conveniently describe rational motions. There exists an algorithm for the factorization of motion polynomials that works in generic cases. It hinges on…

In this paper, we compute the tightest possible bounds on the probability that the optimal value of a combinatorial optimization problem in maximization form with a random objective exceeds a given number, assuming only knowledge of the…

We prove a new upper bound for the number of smooth values of a polynomial with integer coefficients. This improves Timofeev's previous result unless the polynomial is a product of linear polynomials with integer coefficients. As an…