English
Related papers

Related papers: On the size of the set A(A+1)

200 papers

Let $m$, $n$ and $p$ be integers with $3\leq m\leq n$ and $(m-1)(n-1)+1\leq p\leq (m-1)m$. We showed in previous papers that if $p\geq (m-1)(n-1)+2$, then typical ranks of $p\times n\times m$-tensors over the real number field are $p$ and…

Rings and Algebras · Mathematics 2017-05-10 Toshio Sumi , Mitsuhiro Miyazaki , Toshio Sakata

Let $G=(V,E)$ be a graph and $p$ a positive integer. The $p$-domination number $\g_p(G)$ is the minimum cardinality of a set $D\subseteq V$ with $|N_G(x)\cap D|\geq p$ for all $x\in V\setminus D$. The $p$-reinforcement number $r_p(G)$ is…

Combinatorics · Mathematics 2012-11-27 You Lu , Jun-Ming Xu

In this note we determine all power series $F(X)\in 1+X\F_p[[X]]$ such that $(F(X+Y))^{-1} F(X)F(Y)$ has only terms of total degree a multiple of $p$. Up to a scalar factor, they are all the series of the form $F(X)=E_p(cX)\cdot G(X^p)$ for…

General Mathematics · Mathematics 2007-05-23 Sandro Mattarei

Given a large finite point set, $P\subset \mathbb R^2$, we obtain upper bounds on the number of triples of points that determine a given pair of dot products. That is, for any pair of positive real numbers, $(\alpha, \beta)$, we bound the…

Combinatorics · Mathematics 2015-02-09 Daniel Barker , Steven Senger

We improve a result of Solymosi on sum-products in R, namely, we prove that max{|A+A|,|AA|}\gg |A|^{4/3+c}, where c>0 is an absolute constant. New lower bounds for sums of sets with small product set are found. Previous results are improved…

Combinatorics · Mathematics 2015-03-31 Sergei Konyagin , Ilya D. Shkredov

We say that a cyclotomic polynomial \Phi_{n}(x) has order three if n is the product of three distinct primes, p<q<r. Let A(n) be the largest absolute value of a coefficient of \Phi_{n}(x) and M(p) be the maximum of A(pqr). In 1968, Sister…

Number Theory · Mathematics 2009-10-16 Jia Zhao , Xianke Zhang

Let P be a set of points and $L$ a set of lines in (F_p)^2, with |P|,|L|\leq N and N<p. We show that P and L generate no more than C N^(3/2 - 1/806 + o(1)) incidences for some absolute constant C. This improves by an order of magnitude on…

Combinatorics · Mathematics 2011-11-03 Timothy G. F. Jones

Let $G$ be a finite group of order divisible by a prime $p$ and let $P\in\Syl_p(G)$. We prove a recent conjecture by Hung stating that $|\Irr_{p'}(G)|\geq \frac{\exp(P/P')-1}{p-1}+2\sqrt{p-1}-1.$ Let $a\geq 2$ be an integer and suppose that…

Group Theory · Mathematics 2023-11-21 Thomas Keller , Yong Yang

For a positive integer $n$ let $\mathfrak{P}_n=\prod_{s_p(n)\ge p} p,$ where $p$ runs over all primes and $s_p(n)$ is the sum of the base $p$ digits of $n$. For all $n$ we prove that $\mathfrak{P}_n$ is divisible by all "small" primes with…

Number Theory · Mathematics 2018-04-25 Olivier Bordellès , Florian Luca , Pieter Moree , Igor E. Shparlinski

We consider the set multi-cover problem in geometric settings. Given a set of points P and a collection of geometric shapes (or sets) F, we wish to find a minimum cardinality subset of F such that each point p in P is covered by (contained…

Computational Geometry · Computer Science 2009-09-04 Chandra Chekuri , Kenneth L. Clarkson , Sariel Har-Peled

Let $A$ be a subset of the cyclic group $\mathbf{Z}/p\mathbf{Z}$ with $p$ prime. It is a well-studied problem to determine how small $|A|$ can be if there is no unique sum in $A+A$, meaning that for every two elements $a_1,a_2\in A$, there…

Combinatorics · Mathematics 2023-09-20 Benjamin Bedert

Let $G$ be a graph of minimum degree at least $k$ and let $G_p$ be the random subgraph of $G$ obtained by keeping each edge independently with probability $p$. We are interested in the size of the largest complete minor that $G_p$ contains…

Combinatorics · Mathematics 2021-07-01 Joshua Erde , Mihyun Kang , Michael Krivelevich

Let $\mathbb{F}_p$ be the field of residue classes modulo a prime number $p$ and let $A$ be a non-empty subset of $\mathbb{F}_p.$ In this paper we give an explicit version of the sum-product estimate of Bourgain, Katz, Tao and Bourgain,…

Number Theory · Mathematics 2007-05-23 M. Z. Garaev

We give a full description of all sets of functions on the group $(\mathbb{ Z}_p, +)$ of prime order which are closed under the composition with the clone generated by $+$ from both sides. Thereby, we also get a description of all iterative…

Rings and Algebras · Mathematics 2019-09-16 Sebastian Kreinecker

We consider generalizations of the classical secretary problem, also known as the problem of optimal choice, to posets where the only information we have is the size of the poset and the number of maximal elements. We show that, given this…

Combinatorics · Mathematics 2012-06-29 Bryn Garrod , Robert Morris

Let $N$ and $p$ be prime numbers with $p \geq 5$ such that $p || (N + 1)$. In a previous paper, we showed that there is a cuspform $f$ of weight 2 and level $\Gamma_0(N^2)$ whose $\ell$-th Fourier coefficient is congruent to $\ell + 1$…

Number Theory · Mathematics 2025-01-09 Jaclyn Lang , Preston Wake

Anderson established a connection between core partitions and order ideals of certain posets by mapping a partition to its $\beta$-set. In this paper, we give a characterization of the poset $P_{(s,s+1,s+2)}$ whose order ideals correspond…

Combinatorics · Mathematics 2014-07-10 Jane Y. X. Yang , Michael X. X. Zhong , Robin D. P. Zhou

Let S be an abelian semigroup, written additively. Let A be a finite subset of S. We denote the cardinality of A by |A|. For any positive integer h, the sumset hA is the set of all sums of h not necessarily distinct elements of A. We define…

Number Theory · Mathematics 2016-12-30 Melvyn B. Nathanson

Let k be a definable L-cardinal. Then there is a set of reals X, class-generic over L, such that L(X) and L have the same cardinals, X has size k in L(X) and some pi-1-2 formula defines X in all set-generic extensions of L(X). Two…

Logic · Mathematics 2009-09-25 Sy D. Friedman

Let $A$ be a set in an abelian group $G$. For integers $h,r \geq 1$ the generalized $h$-fold sumset, denoted by $h^{(r)}A$, is the set of sums of $h$ elements of $A$, where each element appears in the sum at most $r$ times. If…

Number Theory · Mathematics 2015-04-01 Francesco Monopoli
‹ Prev 1 8 9 10 Next ›