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

We state a kind of Euclidian division theorem: given a polynomial P(x) and a divisor d of the degree of P, there exist polynomials h(x),Q(x),R(x) such that P(x) = h(Q(x)) +R(x), with deg h=d. Under some conditions h,Q,R are unique, and Q is…

A persistent dynamical system in $\mathbb{R}^d_{> 0}$ is one whose solutions have positive lower bounds for large $t$, while a permanent dynamical system in $\mathbb{R}^d_{> 0}$ is one whose solutions have uniform upper and lower bounds for…

By proving the minimality of face transformations acting on the diagonal points and searching the points allowed in the minimal sets, it is shown that the regionally proximal relation of order $d$, $\RP^{[d]}$, is an equivalence relation…

While dynamic policies have historically formed the foundation of most influential papers dedicated to the joint replenishment problem, we are still facing profound gaps in our structural understanding of optimal such policies as well as in…

Let $d\in\mathbb{Z}$ and $p_i$ be an integral polynomial with $p_i(0)=0,1\leq i\leq d$. It is shown that if $S$ is thickly syndetic in $\mathbb{Z}$, then $\{(m,n)\in\mathbb{Z}^2:m+p_i(n),m+p_2(n),\ldots,m+p_d(n)\in S\}$ is thickly syndetic…

In this paper, it is shown that for $d\in\mathbb{N}$, a minimal system $(X,T)$ is a $d$-step pro-nilsystem if its enveloping semigroup is a $d$-step top-nilpotent group, answering an open question by Donoso. Thus, combining the previous…

Let $X, X_1, X_2,\ldots $ be a sequence of non-lattice i.i.d. random variables with ${\bf E} X=0,$ ${\bf E} X=1,$ and let $S_n:= X_1+ \cdots+ X_n$, $n\ge 1.$ We refine Stone's integro-local theorem by deriving the first term in the…

Reinforcement learning with function approximation has recently achieved tremendous results in applications with large state spaces. This empirical success has motivated a growing body of theoretical work proposing necessary and sufficient…

We introduce a machine free mathematical framework to get a natural formalization of some general notions of infinite computation in the context of Kolmogorov complexity. Namely, the classes Max^{X\to D}_{PR} and Max^{X\to D}_{Rec} of…

Let $V$ be a vector space over a field $k, P:V\to k, d\geq 3$. We show the existence of a function $C(r,d)$ such that $rank (P)\leq C(r,d)$ for any field $k,char (k)>d$, a finite-dimensional $k$-vector space $V$ and a polynomial $P:V\to k$…

Our aim was to generalize some theorems about the saturation of ultra-powers to reduced powers. Naturally, we deal via saturation for types consisting of atomic formulas. We succeed to generalize the theory of dense linear is maximal and so…

Suppose that $A \subset \mathbb{R}$ has positive upper density, \[ \limsup_{|I| \to \infty} \frac{|A \cap I|}{|I|} = \delta > 0,\] and $P(t) \in \mathbb{R}[t]$ is a polynomial with no constant or linear term, or more generally a non-flat…

This note mainly concerns the binomial power function, defined as $(1+x^q)^{r}$. We construct systems of polynomials related to non-local approximation, which allows us to establish the density results on $C[a,b]$, where $a,b\in\mathbb{R}$.…

The set ${\cal P}^{m\times n}_{r,d}$ of $m \times n$ complex matrix polynomials of grade $d$ and (normal) rank at most $r$ in a complex $(d+1)mn$ dimensional space is studied. For $r = 1, \dots , \min \{m, n\}-1$, we show that ${\cal…

We study almost automorphic solutions of the discrete delayed neutral dynamic system% \[ x(t+1)=A(t)x(t)+\Delta Q(t,x(t-g(t)))+G(t,x(t),x(t-g(t))) \] by means of a fixed point theorem due to Krasnoselskii. Using discrete variant of…

We prove a structural result for degree-$d$ polynomials. In particular, we show that any degree-$d$ polynomial, $p$ can be approximated by another polynomial, $p_0$, which can be decomposed as some function of polynomials $q_1,...,q_m$ with…

We introduce a deep learning model that can universally approximate regular conditional distributions (RCDs). The proposed model operates in three phases: first, it linearizes inputs from a given metric space $\mathcal{X}$ to $\mathbb{R}^d$…

Let $k\leq n$. Each polynomial $p\in\oR[x_1,...,x_n]$ can be uniquely written as $p=\sum_{\mu}\mu p_{\mu}$, where $\mu$ ranges over the set $M$ of all monomials in $\oR[x_1,...,x_k]$ and where $p_{\mu}\in\oR[x_{k+1},...,x_n]$. If $p$ is…

In this paper, we first consider the graph of $(F_1,F_{2},\cdots,F_{n})$ on $\overline{\mathbb{D}}^{n},$ where $F_{j}(z)=\bar{z}^{m_{j}}_{j}+R_{j}(z),j=1,2,\cdots,n,$ which has non-isolated CR-singularities if $m_{j}>1$ for some…

This paper is to study the Ehrhart function $L(P,t)$ of a rational $n$-polytope $P$, defined as the number of lattice points of dilated polytopes $tP$ with real numbers $t\geq 0$. It turns out that $L(P,t)$ is a quasi-polynomial of real…