Related papers: New Lower Bounds for Some Multicolored Ramsey Numb…
We obtain new bounds on some trilinear and quadrilinear character sums, which are non-trivial starting from very short ranges of the variables. An application to an apparently new problem on oscillations of characters on differences between…
In this work, we classify all finite groups such that for every field extension F of \mathbb{Q}, F is the field of values of at most 3 irreducible characters.
Let $F$ be a field of characteristic not $2$ with finitely many square classes. Using combinatorial arguments applied to objects related to vector spaces over finite fields, we deduce an upper bound for the number of Pfister forms over $F$.…
Let $A_1,\ldots,A_n$ be finite subsets of an additive abelian group $G$ with $|A_1|=\cdots=|A_n|\ge2$. Concerning the two new kinds of restricted sumsets $$L(A_1,\ldots,A_n)=\{a_1+\cdots+a_n:\ a_1\in A_1,\ldots,a_n\in A_n,\ \text{and}\…
Recently, Ma, Shen and Xie broke the Erd\H{o}s barrier for off-diagonal Ramsey numbers $R(\ell,C\ell)$, achieving the first exponential improvement over the classical lower bound for every $C>1$ and sufficiently large $\ell$. Hunter,…
The Ramsey number $R(s,t)$ is the least integer $n$ such that any coloring of the edges of $K_n$ with two colors produces either a monochromatic $K_s$ in one color or a monochromatic $K_t$ in the other. If $s=t$, we say that the Ramsey…
Given two finite posets $\mathcal P$ and $\mathcal Q$, their Ramsey number, denoted by $R(\mathcal P,\mathcal Q)$, is defined to be the smallest integer $N$ such that any blue/red colouring of the vertices of the hypercube $Q_N$ has either…
We propose an algorithm to find a lower bound for the number of cyclic codes over any finite field with any given exponent. Besides, we give a formula to find the exponent of BCH codes.
We obtain upper bounds, independent of the ambient dimension, for the number of realizable zero-nonzero patterns and (over ordered fields) sign conditions of a finite family of polynomials $\mathcal P$ restricted to an algebraic subset $V$…
We give an explicitly computable lower bound for the arithmetic self-intersection number of the dualizing sheaf on a large class of arithmetic surfaces. If some technical conditions are satisfied, then this lower bound is positive. In…
Chains of minimal degree rational curves have been used as an important tool in the study of Fano manifolds. Their own geometric properties, however, have not been studied much. The goal of the paper is to introduce an infinitesimal method…
We estimate Ramsey numbers for bipartite graphs with small bandwidth and bounded maximum degree. In particular we determine asymptotically the two and three color Ramsey numbers for grid graphs. More generally, we determine asymptotically…
In this paper we obtain significant bounds for the number of maximal subgroups of a given index of a finite group. These results allow us to give new bounds for the number of random generators needed to generate a finite $d$-generated group…
We present a new lower bound on the number of contingency tables, improving upon and extending previous lower bounds by Barvinok and Gurvits. As an application, we obtain new lower bounds on the volumes of flow and transportation polytopes.…
We study the minimal number of ramified primes in Galois extensions of rational function fields over finite fields with prescribed finite Galois group. In particular, we obtain a general conjecture in analogy with the well studied case of…
We show that the $k$-colour Ramsey number of an odd cycle of length $2 \ell + 1$ is at most $(4 \ell)^k \cdot k^{k/\ell}$. This proves a conjecture of Fox and is the first improvement in the exponent that goes beyond an absolute constant…
We test numerically the refined Manin's conjecture about the asymptotics of points of bounded height on Fano varieties for some diagonal cubic surfaces.
We obtain upper bounds on the number of singular points of factorial terminal Fano threefolds.
We obtain new bounds on short Weil sums over small multiplicative subgroups of prime finite fields which remain nontrivial in the range the classical Weil bound is already trivial. The method we use is a blend of techniques coming from…
We present some new lower bound estimates for certain numbers in Laver table theory and introduce several related structures of interest.