相关论文: A refined saturation theorem for polynomials and a…

For a sequence of polynomials $\{p_k(t)\}$ in one real or complex variable, where $p_k$ has degree $k$, for $k\ge 0$, we find explicit expressions and recurrence relations for infinite matrices whose entries are the coefficients $d(n,m,k)$,…

We present a study of dynamical scaling and front motion in a one dimensional system that describes Rayleigh-Benard convection in a rotating cell. We use a model of three competing modes proposed by Busse and Heikes to which spatial…

We consider the Low Rank Approximation problem, where the input consists of a matrix $A \in \mathbb{R}^{n_R \times n_C}$ and an integer $k$, and the goal is to find a matrix $B$ of rank at most $k$ that minimizes $\| A - B \|_0$, which is…

In this work, we extend the robust version of the Sylvester-Gallai theorem, obtained by Barak, Dvir, Wigderson and Yehudayoff, and by Dvir, Saraf and Wigderson, to the case of quadratic polynomials. Specifically, we prove that if…

Function approximation is a generic process in a variety of computational problems, from data interpolation to the solution of differential equations and inverse problems. In this work, a unified approach for such techniques is…

Given a function f: [a,b] -> R, if f(a) < 0 and f(b)> 0 and f is continuous, the Intermediate Value Theorem implies that f has a root in [a,b]. Moreover, given a value-oracle for f, an approximate root of f can be computed using the…

We will introduce the notion of Emergence for a dynamical system, and we will conjecture the local typicality of super-polynomial ones. Then, as part of this program, we will provide sufficient conditions for an open set of Cd-families of…

Let $\{X(\mathbf{t}):\mathbf{t}=(t_1, t_2, \ldots, t_d)\in[0,\infty)^d\}$ be a centered stationary Gaussian field with almost surely continuous sample paths, unit variance and correlation function $r$ satisfying conditions $r(\mathbf{t})<1$…

The existence of a finite global attractor for polynomial curve system has been known since the work of Belk et al. [4]. However, except in the hyperbolic case, the rate at which the pullback of a curve under a polynomial converges to the…

Motivated by the $(q,\gamma)$-cumulants, introduced by Xu [arXiv:2303.13812] to study $\beta$-deformed singular values of random matrices, we define the $(n,d)$-rectangular cumulants for polynomials of degree $d$ and prove several…

We consider the polynomials $\displaystyle f(x)=x^d+c$, where $d\ge 2$ and $c\in\mathbb Q$. It is conjectured that if $d=2$, then $f$ has no rational periodic point of exact period $N\ge 4$. In this note, fixing some integer $d\ge 2$, we…

We study approximation properties of sequences of centered random elements $X_d$, $d\in\mathbb{N}$, with values in separable Hilbert spaces. We focus on sequences of tensor product-type random elements, which have covariance operators of…

The classical problem of maximizing the Shannon entropy of a sum of independent random variables supported on a finite alphabet is considered and settled in the ternary case. Namely, the following theorem is established: if…

We show that deciding whether a sparse univariate polynomial has a p-adic rational root can be done in NP for most inputs. We also prove a polynomial-time upper bound for trinomials with suitably generic p-adic Newton polygon. We thus…

It is a theorem of Denker and Urba\'nski ('91) that if $T:\mathbb C\to\mathbb C$ is a rational map of degree at least two and if $\phi:\mathbb C\to\mathbb R$ is H\"older continuous and satisfies the "thermodynamic expanding" condition…

In this article, we study some special cases of the problem of classifying polynomials $p:\mathbb{R}^2_+\to (0,\infty)$ for which the net $\{\frac{1}{p(m,n)}\}_{m,n\in \mathbb{Z}_+}$ is a completely monotone net, where $p(x,y)=b(x)+a(x)y$,…

We consider a problem which has received considerable attention in systems literature because of its applications to routing in delay tolerant networks and replica placement in distributed storage systems. In abstract terms the problem can…

We present a new distributed model of probabilistically checkable proofs (PCP). A satisfying assignment $x \in \{0,1\}^n$ to a CNF formula $\varphi$ is shared between two parties, where Alice knows $x_1, \dots, x_{n/2}$, Bob knows…

Let $t\geq 1$, let $A$ and $B$ be finite, nonempty subsets of an abelian group $G$, and let $A\pp{i} B$ denote all the elements $c$ with at least $i$ representations of the form $c=a+b$, with $a\in A$ and $b\in B$. For $|A|, |B|\geq t$, we…

This work studies the average complexity of solving structured polynomial systems that are characterized by a low evaluation cost, as opposed to the dense random model previously used. Firstly, we design a continuation algorithm that…