English
Related papers

Related papers: The Dixmier conjecture and the shape of possible c…

200 papers

Assuming the generalized Lindel\"of hypothesis for Dirichlet $L$-functions, we establish that the least prime $p\equiv a\pmod{q}$ satisfies $p\ll_{\varepsilon} q^{2+\varepsilon}$. This achieves a bound that nearly matches the classical…

Number Theory · Mathematics 2026-03-27 Matías Bruna

Let p be a prime, B a p-block of a finite group G and b its Brauer correspondent. According to the Alperin-McKay Conjecture, there exists a bijection between the set of irreducible ordinary characters of height zero of B and those of b. In…

Representation Theory · Mathematics 2022-12-16 J. Miquel Martìnez , Damiano Rossi

We prove the following conjecture of Furstenberg (1969): if $A,B\subset [0,1]$ are closed and invariant under $\times p \mod 1$ and $\times q \mod 1$, respectively, and if $\log p/\log q\notin \mathbb{Q}$, then for all real numbers $u$ and…

Dynamical Systems · Mathematics 2019-02-08 Meng Wu

In this short note, we consider the conjecture that the log canonical divisor (resp. the anti-log canonical divisor) $K_X + \Delta$ (resp. $-(K_X + \Delta)$) on a pair $(X, \Delta)$ consisting of a complex projective manifold $X$ and a…

Algebraic Geometry · Mathematics 2007-05-23 Shigetaka Fukuda

We give an upper bound on the number of extensions of a fixed number field of prescribed degree and discriminant less than X; these bounds improve on work of Schmidt. We also prove various related results, such as lower bounds for the…

Number Theory · Mathematics 2007-05-23 Jordan S. Ellenberg , Akshay Venkatesh

We show that the proportion of polynomials of degree $n$ over the finite field with $q$ elements, which have a divisor of every degree below $n$, is given by $c_q n^{-1} + O(n^{-2})$. More generally, we give an asymptotic formula for the…

Number Theory · Mathematics 2016-05-25 Andreas Weingartner

We first study the mean value of certain restricted divisor sums involving the Chowla-Walum sums, improving in particular a recent estimate given by Iannucci. The aim of the second part of this work is the generalization of the previous…

Number Theory · Mathematics 2019-11-01 Olivier Bordellès

If $s$ is a positive integer and $A$ is a set of positive integers, we say that $B$ is an $s$-divisor of $A$ if $\sum_{b\in B} b\mid s\sum_{a\in A} a$. We study the maximal number of $k$-subsets of an $n$-element set that can be…

Combinatorics · Mathematics 2015-05-21 Samuel Zbarsky

We give the proof of a tight lower bound on the probability that a binomial random variable exceeds its expected value. The inequality plays an important role in a variety of contexts, including the analysis of relative deviation bounds in…

Machine Learning · Computer Science 2013-11-12 Spencer Greenberg , Mehryar Mohri

Let $f(x)$ be a polynomial of degree $n \ge 1$ with real coefficients and let $X \ge 2$ and $\delta \ge 0$ be real numbers. Let $\|\cdot\|$ be the distance to the nearest integer. We obtain upper bounds for the number of solutions to the…

Number Theory · Mathematics 2019-01-30 Patrick Letendre

Zagier provided eleven conjectural rank two examples for Nahm's problem. All of them have been proved in the literature except for the fifth example, and there is no $q$-series proof for the tenth example. We prove that the fifth and the…

Number Theory · Mathematics 2023-03-03 Zhineng Cao , Hjalmar Rosengren , Liuquan Wang

We give an unconditional proof of the Coba conjecture for wonderful compactifications of adjoint type for semisimple Lie groups of type $A_n$. We also give a proof of a slightly weaker conjecture for wonderful compactifications of adjoint…

Algebraic Geometry · Mathematics 2025-04-08 Christopher Manon , David McKinnon , Matthew Satriano

We prove Dirichlet's theorem for polynomial rings: Let F be a pseudo algebraically closed field. Then for all relatively prime polynomials a(X), b(X)\in F[X] and for every sufficiently large positive integer n there exist infinitely many…

Number Theory · Mathematics 2009-07-16 L. Bary-Soroker

Recently, the author found that there is a common mistake in some papers by using minimal counterexample and discharging method. We first discuss how the mistake is generated, and give a method to fix the mistake. As an illustration, we…

Combinatorics · Mathematics 2014-03-05 Tao Wang

In this paper, we introduce the zero divisor graph of a multiplicative lattice. We provide a counter example to Beck's conjecture for multiplicative lattices. Further, we prove that Beck's conjecture is true for reduced multiplicative…

Commutative Algebra · Mathematics 2013-10-18 Vinayak Joshi , Sachin Sarode

We find a new, asymptotically better, bound $g\le\frac14d^2+O(d)$ on the genus of a curve that may violate the generalized total reality conjecture. The bound covers all known cases except $g=0$ (the original conjecture).

Algebraic Geometry · Mathematics 2012-05-01 Alex Degtyarev

In this paper, building among others on earlier works by U. Krause and C. Zahlten (dealing with the case of cyclic groups), we obtain a new upper bound for the little cross number valid in the general case of arbitrary finite Abelian…

Number Theory · Mathematics 2011-10-11 Benjamin Girard

Let $t \in \mathbb{N}$, $\eta >0$. Suppose that $x$ is a sufficiently large real number and $q$ is a natural number with $q \leq x^{5/12-\eta}$, $q$ not a multiple of the conductor of the exceptional character $\chi^*$ (if it exists).…

Number Theory · Mathematics 2016-01-27 Roger C. Baker , Liangyi Zhao

In this work we find new minimum sizes for the maximal partial spreads of PG$(3,q)$, for $q=8,9,16$ and for every $q$ such that $25\leq q\leq 101$. Furthermore, for $q=8,9,16,25$ and 27 we find all the unknown sizes between our minimums and…

Combinatorics · Mathematics 2011-11-15 Maurizio Iurlo , Sandro Rajola

Pinsker's widely used inequality upper-bounds the total variation distance $||P-Q||_1$ in terms of the Kullback-Leibler divergence $D(P||Q)$. Although in general a bound in the reverse direction is impossible, in many applications the…

Information Theory · Computer Science 2014-02-21 Daniel Berend , Peter Harremoës , Aryeh Kontorovich