Related papers: Logarithmic inequalities under an elementary symme…
The purpose of this note is to revive in $L^p$ spaces the original A. Markov ideas to study monotonicity of zeros of orthogonal polynomials. This allows us to prove and improve in a simple and unified way our previous result [Electron.…
We study the algorithmic complexity of fair division problems with a focus on minimizing the number of queries needed to find an approximate solution with desired accuracy. We show for several classes of fair division problems that under…
In a recent paper the authors studied the denominators of polynomials that represent power sums by Bernoulli's formula. Here we extend our results to power sums of arithmetic progressions. In particular, we obtain a simple explicit…
We prove a weak comparison principle in narrow unbounded domains for solutions to $-\Delta_p u=f(u)$ in the case $2<p< 3$ and $f(\cdot)$ is a power-type nonlinearity, or in the case $p>2$ and $f(\cdot)$ is super-linear. We exploit it to…
In this paper, we investigate the complete monotonicity of R\'enyi entropy along the heat flow. We confirm this property for the order of derivative up to $4$, when the order of R\'enyi entropy is in certain regimes. We also investigate…
Comparison-based algorithms are algorithms for which the execution of each operation is solely based on the outcome of a series of comparisons between elements. Comparison-based computations can be naturally represented via the following…
We give a simple proof of the fact that for a large class of quasilinear elliptic equations and systems the solutions that minimize the corresponding energy in the set of all solutions are radially symmetric. We require just continuous…
In this paper we study several monotonicity axioms in approval-based multi-winner voting rules. We consider monotonicity with respect to the support received by the winners and also monotonicity in the size of the committee. Monotonicity…
It is shown that the sum of class numbers of orders in totally complex quartic fields with no real quadratic subfield obeys an asymptotic law similar to the prime numbers, as the bound on the regulators tends to infinity. Here only orders…
We investigate the relationship between several enumeration complexity classes and focus in particular on problems having enumeration algorithms with incremental and polynomial delay (IncP and DelayP respectively). We show that, for some…
We improve and expand in two directions the theory of norms on complex matrices induced by random vectors. We first provide a simple proof of the classification of weakly unitarily invariant norms on the Hermitian matrices. We use this to…
We study the distribution of the order of a random permutation of $[n]$ through the lens of R\'enyi entropy. In particular, we obtain an asymptotic for the R\'enyi $q$-entropy of the order in the full range $1 \leq q \leq \infty$. For $q >…
We generalize a previous inequality related to a sharp version of the Littlewood conjecture on the minimal $L_1$-norm of $N$-term exponential sums $f$ on the unit circle. The new result concerns replacing the expression $\log(1+t|f|^2)$…
We consider systems of ordinary differential equations with quadratic homogeneous right hand side. We give a new simple proof of a result already obtained in [8,10] which gives the necessary conditions for the existence of polynomial first…
Many questions in number theory concern the nonvanishing of determinants of square matrices of logarithms (complex or p-adic) of algebraic numbers. We present a new conjecture that states that if such a matrix has vanishing determinant,…
Starting from Montgomery's conjecture, there has been a substantial interest on the connections of random matrix theory and the theory of L-functions. In particular, moments of characteristic polynomials of random matrices have been…
These lecture notes provide an introduction to the theory and application of symmetry methods for ordinary differential equations, building on minimal prerequisites. Their primary purpose is to enable a quick and self-contained approach for…
In these short notes, we will show the following. Let F_q be a finite field and let E/\F_q be an elliptic curve. Let S_r be the rth summation/Semaev polynomial for E. Under an assumption, we show that it is NP-complete to check if S_r…
We present an elementary method for proving enumeration formulas which are polynomials in certain parameters if others are fixed and factorize into distinct linear factors over Z. Roughly speaking the idea is to prove such formulas by…
We use the resolution of singularities algorithm of [G4] to provide new estimates for exponential sums as well as new bounds on how often a function f(x) such as a polynomial with integer coefficients is divisible by various powers of a…