中文
相关论文

相关论文: Polynomial mean complexity and Logarithmic Sarnak …

200 篇论文

Let $(X, T)$ be a topological dynamical system. We show that if each invariant measure of $(X, T)$ gives rise to a measure-theoretic dynamical system that is either: a. rigid along a sequence of "bounded prime volume" or b. admits a…

动力系统 · 数学 2024-03-19 Adam Kanigowski , Mariusz Lemańczyk , Maksym Radziwiłł

We first propose a generalization of the image conjecture [Z3] for the commuting differential operators related with classical orthogonal polynomials. We then show that the non-trivial case of this generalized image conjecture is equivalent…

复变函数 · 数学 2010-04-06 Wenhua Zhao

We present a new probabilistic symbolic algorithm that, given a variety defined in an n-dimensional affine space by a generic sparse system with fixed supports, computes the Zariski closure of its projection to an l-dimensional coordinate…

代数几何 · 数学 2014-01-24 María Isabel Herrero , Gabriela Jeronimo , Juan Sabia

The $MLS$ conjecture states that every finite simple group has a minimal logarithmic signature. The aim of this paper is proving the existence of a minimal logarithmic signature for some simple unitary groups $PSU_{n}(q)$. We report a gap…

群论 · 数学 2019-08-13 A. R. Rahimipour , A. R. Ashrafi

This paper extends earlier work on the distribution in the complex plane of the roots of random polynomials. In this paper, the random polynomials are generalized to random finite sums of given "basis" functions. The basis functions are…

概率论 · 数学 2016-08-04 Robert J. Vanderbei

Renormalized homotopy continuation on toric varieties is introduced as a tool for solving sparse systems of polynomial equations, or sparse systems of exponential sums. The cost of continuation depends on a renormalized condition length,…

数值分析 · 数学 2025-06-23 Gregorio Malajovich

We analyze the Fourier growth, i.e. the $L_1$ Fourier weight at level $k$ (denoted $L_{1,k}$), of various well-studied classes of "structured" $\mathbb{F}_2$-polynomials. This study is motivated by applications in pseudorandomness, in…

计算复杂性 · 计算机科学 2024-10-15 Jarosław Błasiok , Peter Ivanov , Yaonan Jin , Chin Ho Lee , Rocco A. Servedio , Emanuele Viola

We resolve a long-standing open question on the relationship between measure-theoretic dynamical complexity and symbolic complexity by establishing the exact word complexity at which measure-theoretic strong mixing manifests: For every…

动力系统 · 数学 2025-10-14 Darren Creutz

We generalize some previous results on random polynomials in several complex variables. A standard setting is to consider random polynomials $H_n(z):=\sum_{j=1}^{m_n} a_jp_j(z)$ that are linear combinations of basis polynomials $\{p_j\}$…

复变函数 · 数学 2024-01-29 Turgay Bayraktar , Tom Bloom , Norm Levenberg

For every $0<s\leq 1$ we construct $s$-dimensional Salem measures in the unit interval that do not admit any Fourier frame. Our examples are generic for each $s$, including all existing types of Salem measures in the literature: random…

经典分析与常微分方程 · 数学 2025-06-03 Longhui Li , Bochen Liu

The codimension-three conjecture states that any regular holonomic module extends uniquely beyond an analytic subset with codimension equal to or larger than three. We give a proof of this conjecture.

代数几何 · 数学 2013-07-30 Masaki Kashiwara , Kari Vilonen

Fix an odd prime $p$. If $r$ is a positive integer and $f$ a polynomial with coefficients in $\mathbb{F}_{p^r}$, let $P_{p,r}(f)$ be the proportion of $\mathbb{P}^1(\mathbb{F}_{p^r})$ that is periodic with respect to $f$. We show that as…

数论 · 数学 2022-08-26 Derek Garton

We study Nivat's conjecture on algebraic subshifts and prove that in some of them every low complexity configuration is periodic. This is the case in the Ledrappier subshift (the 3-dot system) and, more generally, in all two-dimensional…

动力系统 · 数学 2018-06-20 Jarkko Kari , Etienne Moutot

In this paper we derive generalizations of different properties of monic polynomial families of binomial type, i.e. families of monic polynomials, for which the binomial theorem holds $$ p_n(\alpha+\beta)=\sum_{k=0}^n…

数论 · 数学 2026-01-13 Danil Krotkov

We consider the problem of linearizing a pseudo-Boolean function $f : \{0,1\}^n \to \mathbb{R}$ by means of $k$ Boolean functions. Such a linearization yields an integer linear programming formulation with only $k$ auxiliary variables. This…

离散数学 · 计算机科学 2024-08-14 Matthias Walter

The paper is related to the following question of P.~L.~Ul'yanov: is it true that for any $2\pi$-periodic continuous function $f$ there is a uniformly convergent rearrangement of its trigonometric Fourier series? In particular, we give an…

经典分析与常微分方程 · 数学 2007-05-23 S. V. Konyagin

Assuming the Generalised Riemann Hypothesis (GRH), we show that for all k, there exist polynomials with coefficients in $\MA$ having no arithmetic circuits of size O(n^k) over the complex field (allowing any complex constant). We also build…

计算复杂性 · 计算机科学 2013-04-23 Hervé Fournier , Sylvain Perifel , Rémi de Verclos

A regularity lemma for polynomials provides a decomposition in terms of a bounded number of approximately independent polynomials. Such regularity lemmas play an important role in numerous results, yet suffer from the familiar shortcoming…

组合数学 · 数学 2026-05-26 Guy Moshkovitz , Dora Woodruff

We study the set of harmonic limits of empirical measures in topological dynamical systems. We obtain a characterization of unique ergodicity based of logarithmic (harmonic) mean convergence in place of Ces\`aro convergence. We introduce…

动力系统 · 数学 2025-09-03 Dominik Kwietniak , Jian Li , Habibeh Pourmand

We prove a general theorem providing smoothed analysis estimates for conic condition numbers of problems of numerical analysis. Our probability estimates depend only on geometric invariants of the corresponding sets of ill-posed inputs.…

数值分析 · 数学 2015-06-26 Peter Buergisser , Felipe Cucker , Martin Lotz