Related papers: A Detailed Proof of Pohst's Inequality

We generalize an inequality conjectured by Pohst in 1977 and recently proved by the author and independently by Battistoni and Molteni. This new inequality improves a bound for the regulator in terms of the discriminant for totally real…

Let $P_n(y_1,\ldots,y_n):= \prod_{1\leq i<j\leq n}\left( 1 -\frac{y_i}{y_j}\right) $ and $P_n:= \sup_{(y_1,\ldots,y_n)}P_n(y_1,\ldots,y_n) $ where the supremum is taken over the $n$-ples $(y_1,\ldots,y_n)$ of real numbers satisfying $0…

In 2019, Andrews investigated integer partitions in which all parts of a given parity are smaller than those of the opposite parity and introduced eight partition functions based on the parity of the smaller parts and parts of a given…

We prove inequalities that compare the regulator of a number field with its absolute discriminant. We refine some ideas in Silverman's work in 1984 where such general inequalities are first proven. In order to prove our main theorems, we…

We consider the number of various partitions of $n$ with parts separated by parity and prove combinatorially several inequalities between these numbers. For example, we show that for $n\geq 5$ we have $p_{od}^{eu}(n)<p_{ed}^{ou}(n)$, where…

In $1977$, G. Bennett proved, by means of non-deterministic methods, an inequality which plays a fundamental role in a series of optimization problems. More precisely, Bennett's inequality shows that, for $p_{1},p_{2} \in\lbrack1,\infty]$…

We present a short proof of a conjecture proposed by I. Ra\c{s}a (2017), which is an inequality involving basic Bernstein polynomials and convex functions. This proof was given in the letter to I. Ra\c{s}a (2017). The methods of our proof…

Current methods for the classification of number fields with small regulator depend mainly on an upper bound for the discriminant, which can be improved by looking for the best possible upper bound of a specific polynomial function over an…

The inequality of Clauser and Horne [ Phys. Rev. D 10, 526 (1974)], intended to overcome the limited scope of other inequalities to deterministic theories, is shown to have a resticted validity even in case of perfect detectors and perfect…

We introduce a new decomposition technique for random variables that maps a generic instance of the prophet inequalities problem to a new instance where all but a constant number of variables have a tractable structure that we refer to as…

An inequality proved firstly by Remak and then generalized by Friedman shows that there are only finitely many number fields with a fixed signature and whose regulator is less than a prescribed bound. Using this inequality, Astudillo, Diaz…

In 1915, Ramanujan proved asymptotic inequalities for the sum of divisors function, assuming the Riemann hypothesis (RH). We consider a strong version of Ramanujan's theorem and define highest abundant numbers that are extreme with respect…

One of the most basic results concerning the number-theoretic properties of the partition function $p(n)$ is that $p(n)$ takes each value of parity infinitely often. This statement was first proved by Kolberg in 1959, and it was…

We establish a general criterion for the validity of inequalities of the following form: A certain convex combination of the values of a convex function at n points and of its value at a weighted mean of these n points is always greater or…

Let $\{u_n\}_n$ be a non-degenerate linear recurrence sequence of integers with Binet's formula given by $u_n= \sum_{i=1}^{m} P_i(n)\alpha_i^n.$ Assume $\max_i \vert \alpha_i \vert >1$. In 1977, Loxton and Van der Poorten conjectured that…

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…

Previous work showed that, for $\nu_2(n)$ the number of partitions of $n$ into exactly two part sizes, one has $\nu_2(16n + 14) \equiv 0 \pmod{4}$. The earlier proof required the technology of modular forms, and a combinatorial proof was…

We consider a simple model of imprecise comparisons: there exists some $\delta>0$ such that when a subject is given two elements to compare, if the values of those elements (as perceived by the subject) differ by at least $\delta$, then the…

In [18] Fournier and Printems establish a methodology which allows to prove the absolute continuity of the law of the solution of some stochastic equations with H\"{o}lder continuous coefficients. This is of course out of reach by using…

The classical Prophet Inequality arises from a fundamental problem in optimal-stopping theory. In this problem, a gambler sees a finite sequence of independent, non-negative random variables. If he stops the sequence at any time, he…