相关论文: A problem on completeness of exponentials
In this paper we consider the set of mu-types, an extension of the set of simple types freely generated from a set of atomic types and the type constructor ->, by a new operator mu, to explicitly denote solutions of recursive equations like…
We propose a general method for optimization with semi-infinite constraints that involve a linear combination of functions, focusing on the case of the exponential function. Each function is lower and upper bounded on sub-intervals by…
In this paper we propose a method for proving some exponential inequalities based on power series expansion and analysis of derivations of the corresponding functions. Our approach provides a simple proof and generates a new class of…
The existence of unimodular forms with small norms on sequence spaces is crucial in a variety of problems in modern analysis. We prove that the infimum of $\left\Vert A\right\Vert $ over all unimodular $d$-linear (complex or real) forms $A$…
We prove new multiplicity results for some elliptic problems with critical exponential growth. More specifically, we show that the problems considered here have arbitrarily many solutions for all sufficiently large values of a certain…
Our paper is devoted to several problems from the field of modified divisors: namely exponential and infinitary divisors. We study the behaviour of modified divisors, sum-of-divisors and totient functions. Main results concern with the…
In this article, I introduce a group-theoretical method to prove positivity of certain linear combinations (with coefficients generally lying in $\mathbb{C}$) of exponential functions under a set of semidefinite linear constraints. The…
We present a version of arithmetic in all finite types which allows for a definition of equality at higher types for which all congruence are derivable, for which the soundness of the Dialectica interpretation is provable inside the system…
This paper considers MEP - Mixed Exponential Polynomials as one class of real exponential polynomials. We introduce a method for proving the positivity of MEP inequalities over positive intervals using the Maclaurin series to approximate…
We say that $d$ is an exponential unitary divisor of $n=p_1^{a_1}... p_r^{a_r}>1$ if $d=p_1^{b_1}... p_r^{b_r}$, where $b_i$ is a unitary divisor of $a_i$, i.e., $b_i\mid a_i$ and $(b_i,a_i/b_i)=1$ for every $i\in \{1,2,...,r\}$. We survey…
A.Olevskii and A.Ulanovskii obtained a scale of density results, which correspond to how well an exponential system approximates a uniformly minimal system over a compact set. We extend their result in several directions. First, we show…
This article studies exponential families $\mathcal{E}$ on finite sets such that the information divergence $D(P\|\mathcal{E})$ of an arbitrary probability distribution from $\mathcal{E}$ is bounded by some constant $D>0$. A particular…
The paper discusses a holomorphic nonlinear singular partial differential equation $(t \partial_t)^mu=F(t,x,\{(t \partial_t)^j \partial_x^{\alpha}u \}_{j+\alpha \leq m, j<m})$ under the assumption that the equation is of nonlinear totally…
In this paper, we define a new realizability semantics for the simply typed lambda-mu-calculus. We show that if a term is typable, then it inhabits the interpretation of its type. We also prove a completeness result of our realizability…
Via a constrained minimization, we find a solution $(\lambda,u)$ to the problem \begin{equation*} \begin{cases} (-\Delta)^m u+\frac{\mu}{|x|^{2m}}u + \lambda u = \eta u^3 + g(u)\\ \int_{\mathbb{R}^{2m}} u^2 \, dx = \rho \end{cases}…
In the affine fragment of continuous logic, type spaces are compact convex sets. I study some model theoretic properties of extreme types. It is proved that every complete theory $T$ has an extremal model, i.e. a model which realizes only…
This paper studies a class of exponential family models whose canonical parameters are specified as linear functionals of an unknown infinite-dimensional slope function. The optimal minimax rates of convergence for slope function estimation…
The complexity function of an infinite word $w$ on a finite alphabet $A$ is the sequence counting, for each non-negative $n$, the number of words of length $n$ on the alphabet $A$ that are factors of the infinite word $w$. For any given…
For an element $a$ of an integral domain D under an equivalence relation \tau, the \tau-factorization of a is defined as \lambda a_1 a_2... a_k, where \lambda is a unit in D and a_i \tau a_j for all i, j. An irreducible element has no…
A vast class of exponential functions are shown to be deterministic. This class includes functions whose exponents are polynomial-like or "piece-wise" close to polynomials after differentiation. Many of these functions are proved to be…