English
Related papers

Related papers: Analytic Properties of Necklace Polynomials

200 papers

Let $\mu$ be a probability measure on $\mathbb{Z}$ that is not a Dirac mass and that has finite support. We prove that if the coefficients of a monic polynomial $f(x)\in\mathbb{Z}[x]$ of degree $n$ are chosen independently at random…

Number Theory · Mathematics 2023-08-16 Lior Bary-Soroker , Dimitris Koukoulopoulos , Gady Kozma

We continue the program of systematic study of extended HOMFLY polynomials. Extended polynomials depend on infinitely many time variables, are close relatives of integrable tau-functions, and depend on the choice of the braid representation…

High Energy Physics - Theory · Physics 2012-09-11 H. Itoyama , A. Mironov , A. Morozov , An. Morozov

A recent conjecture by I. Ra\c{s}a asserts that the sum of the squared Bernstein basis polynomials is a convex function in $[0,1]$. This conjecture turns out to be equivalent to a certain upper pointwise estimate of the ratio…

Classical Analysis and ODEs · Mathematics 2014-02-27 Geno Nikolov

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…

Mathematical Physics · Physics 2018-04-02 Mengkun Zhu , Yang Chen

We study a natural measurable selection problem for which the standard uniformisation theorems do not seem to apply directly, yet a Borel selector exists. More precisely, we consider families of finite dimensional functions that admit…

Logic · Mathematics 2026-03-23 Eugenio Clerico

An FI- or an OI-module $\mathbf{M}$ over a corresponding noetherian polynomial algebra $\mathbf{P}$ may be thought of as a sequence of compatible modules $\mathbf{M}_n$ over a polynomial ring $\mathbf{P}_n$ whose number of variables depends…

Commutative Algebra · Mathematics 2020-06-24 Uwe Nagel

We consider a class of monotone operators which are appropriate for symbolic representation and manipulation within a computer algebra system. Various structural properties of the class (e.g., closure under taking inverses, resolvents) are…

Optimization and Control · Mathematics 2018-05-28 Florian Lauster , D. Russell Luke , Matthew K. Tam

The question how to certify non-negativity of a polynomial function lies at the heart of Real Algebra and also has important applications to Optimization. In this article we investigate the question of non-negativity in the context of…

Optimization and Control · Mathematics 2015-11-24 Paul Görlach , Cordian Riener , Tillmann Weißer

The approximation properties of the finite element method can often be substantially improved by choosing smooth high-order basis functions. It is extremely difficult to devise such basis functions for partitions consisting of arbitrarily…

Numerical Analysis · Mathematics 2021-01-18 Eky Febrianto , Michael Ortiz , Fehmi Cirak

The family of lattice simplices in $\mathbb{R}^n$ formed by the convex hull of the standard basis vectors together with a weakly decreasing vector of negative integers include simplices that play a central role in problems in enumerative…

Combinatorics · Mathematics 2017-10-05 Liam Solus

The paper is devoted to a comprehensive second-order study of a remarkable class of convex extended-real-valued functions that is highly important in many aspects of nonlinear and variational analysis, specifically those related to…

Optimization and Control · Mathematics 2015-07-21 Boris S. Mordukhovich , M. Ebrahim Sarabi

We mainly establish a monotonicity property between some special Riemann sums of a convex function $f$ on $[a,b]$, which in particular yields that $\frac{b-a}{n+1}\sum_{i=0}^n f\left(a+i\frac{b-a}{n}\right)$ is decreasing while…

Classical Analysis and ODEs · Mathematics 2014-10-07 Jamal Rooin , Hossein Dehghan

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…

Mathematical Physics · Physics 2017-06-13 Francesco Calogero , Francois Leyvraz

Real-world machine learning applications may require functions that are fast-to-evaluate and interpretable. In particular, guaranteed monotonicity of the learned function can be critical to user trust. We propose meeting these goals for…

We discuss two surprising properties of a family of polynomials that generalize the Mahonian $q$-Catalan polynomials, and more generally the $q$-Schr\"oder polynomials. By interpreting them as $\mathfrak{sl}_2$-characters, we show that the…

Combinatorics · Mathematics 2020-09-23 Eric Nathan Stucky

We study a question on characterizing polynomials among rational functions of degree $>1$ on the projective line over an algebraically closed field that is complete with respect to a non-trivial and non-archimedean absolute value, from the…

Number Theory · Mathematics 2020-01-14 Yûsuke Okuyama , Małgorzata Stawiska

Let $\xi_0,\xi_1,...$ be independent identically distributed (i.i.d.) random variables such that $\E \log (1+|\xi_0|)<\infty$. We consider random analytic functions of the form $$ G_n(z)=\sum_{k=0}^{\infty} \xi_k f_{k,n} z^k, $$ where…

Probability · Mathematics 2012-10-02 Zakhar Kabluchko , Dmitry Zaporozhets

In this article we study the influence of regularly varying probability measures on additive and multiplicative Boolean convolutions. We introduce the notion of Boolean subexponentiality (for additive Boolean convolution), which extends the…

Probability · Mathematics 2018-08-13 Sukrit Chakraborty , Rajat Subhra Hazra

Ezra Getzler notes in the proof of the main theorem of "The semi-classical approximation for modular operads" that "A proof of the theorem could no doubt be given using [a combinatorial interpretation in terms of a sum over necklaces];…

Algebraic Geometry · Mathematics 2013-08-27 Dan Petersen

The real type of a finite family of univariate polynomials characterizes the combined sign behavior of the polynomials over the real line. We derive an explicit formula for the number of real types subject to given degree bounds. For the…

Symbolic Computation · Computer Science 2025-02-10 Nicolas Faroß , Thomas Sturm