Related papers: Logarithmic inequalities under an elementary symme…
In the paper, by establishing the monotonicity of some functions involving the sine and cosine functions, the authors provide concise proofs of some known inequalities and find some new sharp inequalities involving the Seiffert,…
We use techniques originating from the subdiscipline of mathematical logic called `proof mining' to provide rates of metastability and - under a metric regularity assumption - rates of convergence for a subgradient-type algorithm solving…
We provide a short proof of the theorem that every real multivariate polynomial has a symmetric determinantal representation, which was first proved in J. W. Helton, S. A. McCullough, and V. Vinnikov, Noncommutative convexity arises from…
This preprint is a text for students and teachers on inequalities. Some standard topics are covered on application of calculus to inequality proving. Many examples are considered, stated, solved or partially solved. Some problems are…
We introduce the entangled quantum polynomial hierarchy $\mathsf{QEPH}$ as the class of problems that are efficiently verifiable given alternating quantum proofs that may be entangled with each other. We prove $\mathsf{QEPH}$ collapses to…
We prove a lower estimate on the increase in entropy when two copies of a conditional random variable $X | Y$, with $X$ supported on $\mathbb{Z}_q=\{0,1,\dots,q-1\}$ for prime $q$, are summed modulo $q$. Specifically, given two i.i.d copies…
We study the problem of generating monomials of a polynomial in the context of enumeration complexity. In this setting, the complexity measure is the delay between two solutions and the total time. We present two new algorithms for…
We give an elementary proof of an analogue of Fej\'er's theorem in weighted Dirichlet spaces with superharmonic weights. This provides a simple way of seeing that polynomials are dense in such spaces.
We give a deterministic polynomial time $2^{O(r)}$-approximation algorithm for the number of bases of a given matroid of rank $r$ and the number of common bases of any two matroids of rank $r$. To the best of our knowledge, this is the…
We represent the number of mxn non-negative integer matrices (contingency tables) with prescribed row sums and column sums as the expected value of the permanent of a non-negative random matrix with exponentially distributed entries. We…
In this lecture notes we try to familiarize the audience with the theory of Bernoulli polynomials; we study their properties, and we give, with proofs and references, some of the most relevant results related to them. Several applications…
We study the compact embedding between smoothness Morrey spaces on bounded domains and characterise its entropy numbers. Here we discover a new phenomenon when the difference of smoothness parameters in the source and target spaces is…
We derive a strengthened monotonicity inequality for quantum relative entropy by employing properties of $\alpha$-R\'{e}nyi relative entropy. We develop a unifying treatment towards the improvement of some quantum entropy inequalities. In…
Given a partition $\lambda$, we write $e_j(\lambda)$ for the $j^{\textrm{th}}$ elementary symmetric polynomial $e_j$ evaluated at the parts of $\lambda$ and $e_jp_A(n)$ for the sum of $e_j(\lambda)$ as $\lambda$ ranges over the set of…
This paper develops a unified framework for proving the existence of solutions to stationary first-order mean-field games (MFGs) based on the theory of monotone operators in Banach spaces. We cast the coupled MFG system as a variational…
We introduce a variant of the R\'enyi entropy definition that aligns it with the well-known H\"older mean: in the new formulation, the r-th order R\'enyi Entropy is the logarithm of the inverse of the r-th order H\"older mean. This brings…
We give a new characterization of elementary and deterministic polynomial time computation in linear logic through the proofs-as-programs correspondence. Girard's seminal results, concerning elementary and light linear logic, achieve this…
A class of autonomous, even-order ordinary differential equations is discussed from the point of view of Lie symmetries. It is shown that for a certain power nonlinearity, the Noether symmetry group coincides with the Lie point symmetry…
We show that a recent definition of relative R\'enyi entropy is monotone under completely positive, trace preserving maps. This proves a recent conjecture of M\"uller-Lennert et al.
The Matrix-based Renyi's entropy enables us to directly measure information quantities from given data without the costly probability density estimation of underlying distributions, thus has been widely adopted in numerous statistical…