Related papers: Finite Bases with Respect to the Superposition in …
The article is devoted to one infinite parametric class of continuous functions with complicated local structure. In the article differential, integral, self-affine and other properties of functions, that their argument is represented by…
We introduce a new class of entire functions $\mathcal{E}$ which consists of all $F_0\in\mathcal{O}(\mathbb{C})$ for which there exists a sequence $(F_n)\in \mathcal{O}(\mathbb{C})$ and a sequence $(\lambda_n)\in\mathbb{C}$ satisfying…
Suppose $X$ and $Y$ are finite complexes, with $Y$ simply connected. Gromov conjectured that the number of mapping classes in $[X,Y]$ which can be realized by $L$-Lipschitz maps grows asymptotically as $L^\alpha$, where $\alpha$ is an…
We prove that all functions obeying the Kramers-Kronig relations can be approximated as superpositions of Lorentzian functions, to any precision. As a result, the typical text-book analysis of dielectric dispersion response functions in…
It is known that a subharmonic function of finite order $\rho$ can be approximated by the logarithm of the modulus of an entire function at the point $z$ outside an exceptional set up to $C\log|z|$. In this article we prove that if such an…
The classical Remez inequality bounds the maximum of the absolute value of a polynomial $P(x)$ of degree $d$ on $[-1,1]$ through the maximum of its absolute value on any subset $Z$ of positive measure in $[-1,1]$. Similarly, in several…
Generalized sampling consists in the recovery of a function $f$, from the samples of the responses of a collection of linear shift-invariant systems to the input $f$. The reconstructed function is typically a member of a finitely generated…
We study the properties of two classes of meromorphic functions in the complex plane. The first one is the class of almost elliptic functions in the sense of Sunyer-i-Balaguer. This is the class of meromorphic functions f such that the…
Composite minimization is a powerful framework in large-scale convex optimization, based on decoupling of the objective function into terms with structurally different properties and allowing for more flexible algorithmic design. We…
Proving proof-size lower bounds for $\mathbf{LK}$, the sequent calculus for classical propositional logic, remains a major open problem in proof complexity. We shed new light on this challenge by isolating the power of structural rules,…
Polynomial completeness results aim at characterizing those functions that are induced by polynomials. Each polynomial function is congruence preserving, but the opposite need not be true. A finite algebraic structure $\mathbf{A}$ is called…
Let X be a finite 2-complex with unfree fundamental group. We prove lower bounds for the area of a metric on X, in terms of the square of the least length of a noncontractible loop in X. We thus establish a uniform systolic inequality for…
We characterize the lack of compactness in the critical embedding of functions spaces $X\subset Y$ having similar scaling properties in the following terms : a sequence $(u_n)_{n\geq 0}$ bounded in $X$ has a subsequence that can be…
Let $\Omega_i\subset\mathbb{R}^{n_i}$, $i=1,\ldots,m$, be given domains. In this article, we study the low-rank approximation with respect to $L^2(\Omega_1\times\dots\times\Omega_m)$ of functions from Sobolev spaces with dominating mixed…
Using polynomial interpolation, along with structural properties of the family of positive real rational functions, we here show that a set of m nodes in the open left half of the complex plane, can always be mapped to anywhere in the…
Composition and demonic refinement $\sqsubseteq$ of binary relations are defined by \begin{align*} (x, y)\in (R;S)&\iff \exists z((x, z)\in R\wedge (z, y)\in S) R\sqsubseteq S&\iff (dom(S)\subseteq dom(R) \wedge…
The classical ``$H=W$" theorem establishes the identity between two function spaces on an arbitrary nonempty open set in the Euclidean spaces: the space $W$ defined via weak derivatives, and the space $H$ defined as the closure of smooth…
We establish new, and surprisingly tight, connections between propositional proof complexity and finite model theory. Specifically, we show that the power of several propositional proof systems, such as Horn resolution, bounded-width…
The decompositions of the Fock and Basic modules of the affine Lie algebra \hat{sl(N)} into irreducible submodules of the Yangian algebra Y(gl(N)) are constructed. Each of the irreducible submodules admits the unique up to normalization…
In this paper, given a simple linear recurrence sequence of algebraic numbers, which has either a dominant characteristic root or exactly two characteristic roots of maximal modulus, we give some explicit lower bounds for the index beyond…