English
Related papers

Related papers: A counterexample to the weak Shanks conjecture

200 papers

In 1976 Suffridge proved an intruiging theorem regarding the convolution of polynomials with zeros only on the unit circle. His result generalizes a special case of the fundamental Grace-Szeg\"o convolution theorem, but so far it is an open…

Complex Variables · Mathematics 2014-05-16 Martin Lamprecht

We show that under mild conditions, a Gaussian analytic function $\boldsymbol F$ that a.s. does not belong to a given weighted Bergman space or Bargmann-Fock space has the property that a.s. no non-zero function in that space vanishes where…

Complex Variables · Mathematics 2020-11-24 Russell Lyons , Alex Zhai

Using Fourier analysis, we prove that the limiting distribution of the standardized random number of comparisons used by Quicksort to sort an array of n numbers has an everywhere positive and infinitely differentiable density f, and that…

Probability · Mathematics 2007-05-23 James Allen Fill , Svante Janson

We first show that a continuous function f is nonnegative on a closed set $K\subseteq R^n$ if and only if (countably many) moment matrices of some signed measure $d\nu =fd\mu$ with support equal to K, are all positive semidefinite (if $K$…

Optimization and Control · Mathematics 2011-05-13 Jean B. Lasserre

Letting $E$, $F$ be Banach spaces, the main two results of this paper are the following: (1) If every (linear bounded) operator $E\rightarrow F$ is unconditionally converging, then every polynomial from $E$ to $F$ is unconditionally…

Functional Analysis · Mathematics 2016-09-06 Manuel Gonzalez , Joaquin M. Gutierrez

We consider the problem of characterizing the extreme points of the set of analytic functions f on the bidisk with positive real part and f(0)=1. If one restricts to those f whose Cayley transform is a rational inner function, one gets a…

Complex Variables · Mathematics 2019-10-30 Greg Knese

Let $\mathcal{A}$ denote the class of normalized analytic functions $f$ in the open unit disk defined as $ \mathbb{D}:=\{z\in\mathbb{C}:|z|<1\} $ with $f(0)=0$ and $f'(0)=1$. A function $f\in\mathcal{A}$ is said to be starlike if…

Complex Variables · Mathematics 2026-04-28 Vasudevarao Allu , Shobhit Kumar

We utilize the same technique as in [arXiv:2205.04254 (2022)] to provide some representations of polynomials non-negative on a basic semi-algebraic set, defined by polynomial inequalities, under more general conditions. Based on each…

Optimization and Control · Mathematics 2022-10-13 Ngoc Hoang Anh Mai

The proximinality of certain subspaces of spaces of bounded affine functions is proved. The results presented here are some linear versions of an old result due to Mazur. For the proofs we use some sandwich theorems of Fenchel's duality…

Functional Analysis · Mathematics 2019-07-24 Maysam Maysami Sadr

The paper contains the proof, in dimension 2, of a conjecture of R. G. Douglas and V. Paulsen concerning the characterization of the ideals of polynomials which are closed in the relative topology induced by the Hardy space of the polydisk.

funct-an · Mathematics 2008-02-03 Razvan Gelca

Building on the recent work of Johnson (2007) and Yu (2008), we prove that entropy is a concave function with respect to the thinning operation T_a. That is, if X and Y are independent random variables on Z_+ with ultra-log-concave…

Information Theory · Computer Science 2009-09-24 Yaming Yu , Oliver Johnson

We show that if $A$ is a finite set of non-negative integers then the number of zeros of the function \[ f_A(\theta) = \sum_{a \in A} \cos(a\theta), \] in $[0,2\pi]$, is at least $(\log \log \log |A|)^{1/2-\varepsilon}$. This gives the…

Classical Analysis and ODEs · Mathematics 2019-02-07 Julian Sahasrabudhe

Let f be a polynomial in two complex variables. We say that f is nearly irreducible if any two nonconstant polynomial factors of f have a common zero. In the paper we give a criterion of nearly irreducibility for a given polynomial f in…

Algebraic Geometry · Mathematics 2019-05-08 Mateusz Masternak

We present an algorithmic equivalent statement to the Jacobian conjecture. Given a polynomial map F on an affine space of dimension n, our algorithm constructs n sequences of polynomials such that F is invertible if and only if the zero…

Commutative Algebra · Mathematics 2015-06-05 Elzbieta Adamus , Pawel Bogdan , Teresa Crespo , Zbigniew Hajto

Let R be an affine k-domain over the field k. The paper's main result is that, if R admits a non-trivial embedding in a polynomial ring K[s] for some field K containing k, then R can be embedded in a polynomial ring F[t] which extends R…

Commutative Algebra · Mathematics 2015-11-04 Gene Freudenburg

Zhang's reverse affine isoperimetric inequality states that among all convex bodies $K\subseteq\mathbb{R}^n$, the affine invariant quantity $|K|^{n-1}|\Pi^*(K)|$ (where $\Pi^*(K)$ denotes the polar projection body of $K$) is minimized if…

Functional Analysis · Mathematics 2018-10-18 David Alonso-Gutiérrez , Julio Bernués , Bernardo González Merino

We provide a new proof of ``most" cases of the polynomial Wiener-Wintner theorem for $\sigma$-finite spaces, using hard-analytic methods. Specifically, we prove that whenever $(X,\mu,T)$ is a $\sigma$-finite measure-preserving system, and…

Dynamical Systems · Mathematics 2025-11-05 Ben Krause

The following selection theorem is established:\\ Let $X$ be a compactum possessing a binary normal subbase $\mathcal S$ for its closed subsets. Then every set-valued $\mathcal S$-continuous map $\Phi\colon Z\to X$ with closed $\mathcal…

General Topology · Mathematics 2013-11-05 Vesko Valov

We show the invalidity of finitary counterparts for three classification theorems: The preservation of being a Bernoulli shift through factors, Sinai's factor theorem, and the weak Pinsker property. We construct a finitary factor of an…

Dynamical Systems · Mathematics 2019-09-30 Uri Gabor

We show that algebraic formulas and constant-depth circuits are closed under taking factors. In other words, we show that if a multivariate polynomial over a field of characteristic zero has a small constant-depth circuit or formula, then…

Computational Complexity · Computer Science 2025-07-01 Somnath Bhattacharjee , Mrinal Kumar , Shanthanu S. Rai , Varun Ramanathan , Ramprasad Saptharishi , Shubhangi Saraf