English
Related papers

Related papers: Inexpressibility in Exp-Minus-Log

200 papers

This paper deals with the problem of universal lossless coding on a countable infinite alphabet. It focuses on some classes of sources defined by an envelope condition on the marginal distribution, namely exponentially decreasing envelope…

Information Theory · Computer Science 2011-07-07 Dominique Bontemps

We introduce a geometric model of shallow multiplicative exponential linear logic (MELL) using the Hilbert scheme. Building on previous work interpreting multiplicative linear logic proofs as systems of linear equations, we show that…

Logic · Mathematics 2026-03-11 William Troiani , Daniel Murfet

The study of Description Logics have been historically mostly focused on features that can be translated to decidable fragments of first-order logic. In this paper, we leave this restriction behind and look for useful and decidable…

Logic in Computer Science · Computer Science 2023-08-30 Joshua Hirschbrunn , Yevgeny Kazakov

We consider the theory of algebraically closed fields of characteristic zero with multivalued operations $x\mapsto x^r$ (raising to powers). It is in fact the theory of equations in exponential sums. In an earlier paper we have described…

Logic · Mathematics 2015-01-15 Boris Zilber

Let $\lambda$ be an integer, and $f(z)=\sum_{n\gg-\infty} a(n)q^n$ be a weakly holomorphic modular form of weight $\lambda+\frac 12$ on $\Gamma_0(4)$ with integral coefficients. Let $\ell\geq 5$ be a prime. Assume that the constant term…

Number Theory · Mathematics 2019-02-19 Dohoon Choi , Subong Lim

We provide an effective upper bound for positive integers with bounded Hamming weights with respect to both a linear recurrence numeration system and an Ostrowski-$\alpha$ numeration system, where $\alpha$ is a quadratic irrational. We…

Number Theory · Mathematics 2024-09-11 Mohit Mittal , Divyum Sharma

We study the representations of the W-algebra W(g) associated to an arbitrary finite-dimensional simple Lie algebra g via the quantized Drinfeld-Sokolov reductions. The characters of irreducible representations with non-degenerate highest…

Quantum Algebra · Mathematics 2007-05-23 Tomoyuki Arakawa

We describe solutions of the matrix equation $\exp(z(A-I_n))=A$, where $z \in {\mathbb C}$. Applications in quantum computing are given. Both normal and nonnormal matrices are studied. For normal matrices, the Lambert W-function plays a…

Mathematical Physics · Physics 2015-01-22 Willi-Hans Steeb , Yorick Hardy

The expansion of a modular graph function on a torus of modulus $\tau$ near the cusp is given by a Laurent polynomial in $y= \pi \Im (\tau)$ with coefficients that are rational multiples of single-valued multiple zeta-values, apart from the…

High Energy Physics - Theory · Physics 2020-02-06 Eric D'Hoker , M. B. Green

Let $\exp[x_0,x_1,\dots,x_n]$ denote the divided difference of the exponential function. (i) We prove that exponential divided differences are log-submodular. (ii) We establish the four-point inequality $…

Classical Analysis and ODEs · Mathematics 2025-10-14 Qiulin Zeng , Nicholas Ezzell , Arman Babakhani , Itay Hen , Lev Barash

Concept of exponential family is generalized by simple and general exponential form. Simple and general potential are introduced. Maximum Entropy and Maximum Likelihood tasks are defined. ML task on the simple exponential form and ME task…

Statistics Theory · Mathematics 2019-08-17 Marian Grendar, , Marian Grendar

Periods are defined as integrals of semialgebraic functions defined over the rationals. Periods form a countable ring not much is known about. Examples are given by taking the antiderivative of a power series which is algebraic over the…

Logic · Mathematics 2024-02-01 Tobias Kaiser

Potential functions in highly pertinent applications, such as deep learning in over-parameterized regime, are empirically observed to admit non-isolated minima. To understand the convergence behavior of stochastic dynamics in such…

Machine Learning · Computer Science 2025-02-18 Yun Gong , Zebang Shen , Niao He

We completely solve ergodic optimization of a full shift with an uncountable alphabet $[0,1]$, which is one of the most well-known examples of infinite dimensional dynamical systems with positive mean dimension (and thus with infinite…

Dynamical Systems · Mathematics 2026-04-29 Yuika Kajihara , Shoya Motonaga , Mao Shinoda

Modular exponentiation is a common mathematical operation in modern cryptography. This, along with modular multiplication at the base and exponent levels (to different moduli) plays an important role in a large number of key agreement…

Symbolic Computation · Computer Science 2010-12-23 Deepak Kapur , Andrew Marshall , Paliath Narendran

We prove the regularity of the $\eta$ function for classical pseudodifferential operators with Shubin symbols. We recall the construction of complex powers and of the Wodzicki and Kontsevich-Vishik functionals for classical symbols on…

Operator Algebras · Mathematics 2012-09-07 Pedro Lopes

Proving super-polynomial lower bounds on the size of proofs of unsatisfiability of Boolean formulas using resolution over parities is an outstanding problem that has received a lot of attention after its introduction by Raz and Tzamaret…

Computational Complexity · Computer Science 2024-02-26 Sreejata Kishor Bhattacharya , Arkadev Chattopadhyay , Pavel Dvořák

We prove several results of concentration for eigenfunctions in Toeplitz quantization. With mild assumptions on the regularity, we prove that eigenfunctions are $O(exp(-cN^{\delta}))$ away from the corresponding level set of the symbol,…

Spectral Theory · Mathematics 2020-01-23 Alix Deleporte

We study the expressivity and complexity of model checking linear temporal logic with team semantics (TeamLTL). TeamLTL, despite being a purely modal logic, is capable of defining hyperproperties, i.e., properties which relate multiple…

Logic in Computer Science · Computer Science 2021-11-24 Jonni Virtema , Jana Hofmann , Bernd Finkbeiner , Juha Kontinen , Fan Yang

This paper introduces modal independence logic MIL, a modal logic that can explicitly talk about independence among propositional variables. Formulas of MIL are not evaluated in worlds but in sets of worlds, so called teams. In this vein,…

Logic in Computer Science · Computer Science 2014-04-02 Juha Kontinen , Julian-Steffen Müller , Henning Schnoor , Heribert Vollmer