English
Related papers

Related papers: New upper bounds for $(b,k)$-hashing

200 papers

Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special case of the well known disjointness problem, and the…

Computational Complexity · Computer Science 2009-02-11 André Gronemeier

It was shown by V. Bergelson that any set B with positive upper multiplicative density contains nicely intertwined arithmetic and geometric progressions: For each positive integer k there exist integers a,b,d such that $ {b(a+id)^j:i,j…

Combinatorics · Mathematics 2014-02-26 Mathias Beiglböck

For any elements b,c of a number field K, let G(b,c) denote the backwards orbit of b under the map f_c: C-->C given by f_c(x)=x^2+c. We prove an upper bound on the number of elements of G(b,c) whose degree over K is at most some constant B.…

A geometric progression of length $k$ and integer ratio is a set of numbers of the form $\{a,ar,\dots,ar^{k-1}\}$ for some positive real number $a$ and integer $r\geq 2$. For each integer $k \geq 3$, a greedy algorithm is used to construct…

Number Theory · Mathematics 2020-04-17 Melvyn B. Nathanson , Kevin O'Bryant

Fix $k$ a positive integer, and let $\ell$ be coprime to $k$. Let $p(k,\ell)$ denote the smallest prime equivalent to $\ell \pmod{k}$, and set $P(k)$ to be the maximum of all the $p(k,\ell)$. We seek lower bounds for $P(k)$. In particular,…

Number Theory · Mathematics 2016-12-23 Junxian Li , Kyle Pratt , George Shakan

Let $n_k(s)$ be the maximal length $n$ such that a quaternary additive $[n,k,n-s]_4$-code exists. We solve a natural asymptotic problem by determining the lim sup $\lambda_k$ of $n_k(s)/s,$ and the smallest value of $s$ such that…

Combinatorics · Mathematics 2023-10-19 Jürgen Bierbrauer , Stefano Marcugini , Fernanda Pambianco

Our main result improves bounds of Markstrom and Rucinski on the minimum d-degree which forces a perfect matching in a k-uniform hypergraph on n vertices. We also extend bounds of Bollobas, Daykin and Erdos by asymptotically determining the…

Combinatorics · Mathematics 2013-12-03 Daniela Kühn , Deryk Osthus , Timothy Townsend

We consider some coloring issues related to the famous Erd\H {o}s Discrepancy Problem. A set of the form $A_{s,k}=\{s,2s,\dots,ks\}$, with $s,k\in \mathbb{N}$, is called a \emph{homogeneous arithmetic progression}. We prove that for every…

Combinatorics · Mathematics 2020-06-01 Bartłomiej Bosek , Jarosław Grytczuk

We study the growth rate of some power-free languages. For any integer $k$ and real $\beta>1$, we let $\alpha(k,\beta)$ be the growth rate of the number of $\beta$-free words of a given length over the alphabet $\{1,2,\ldots, k\}$. Shur…

Combinatorics · Mathematics 2021-05-12 Matthieu Rosenfeld

In $\mathbb{R}^n$, we establish an asymptotically sharp upper bound for the upper Minkowski dimension of $k$-porous sets having holes of certain size near every point in $k$ orthogonal directions at all small scales. This bound tends to…

Classical Analysis and ODEs · Mathematics 2017-01-31 Esa Järvenpää , Maarit Järvenpää , Antti Käenmäki , Ville Suomala

We derive asymptotic expansions of the Kummer functions $M(a,b,z)$ and $U(a,b+1,z)$ for large positive values of $a$ and $b$, with $z$ fixed. For both functions we consider $b/a\le 1$ and $b/a\ge 1$, with special attention for the case…

Classical Analysis and ODEs · Mathematics 2021-02-24 Nico M. Temme

Given feasible strongly regular graph parameters $(v,k,\lambda,\mu)$ and a non-negative integer $d$, we determine upper and lower bounds on the order of a $d$-regular induced subgraph of any strongly regular graph with parameters…

Combinatorics · Mathematics 2022-02-22 Rhys J. Evans

Based on a result of Makeev, in 2012 Blagojevi\'c and Karasev proposed the following problem: given any positive integers $m$ and $1\leq \ell\leq k$, find the minimum dimension $d=\Delta(m;\ell/k)$ such that for any $m$ mass distributions…

Combinatorics · Mathematics 2024-03-12 Andres Mejia , Steven Simon , Jialin Zhang

Let $K_n$ denote the set of all nonsingular $n\times n$ lower triangular $(0,1)$-matrices. Hong and Loewy (2004) introduced the number sequence $$ c_n=\min\{\lambda\mid\lambda~\text{is an eigenvalue of}~XX^{\rm T},~X\in K_n\},\quad…

Combinatorics · Mathematics 2025-08-08 Vesa Kaarnioja , André-Alexander Zepernick

Let $\mathbb{N}$ be the set of all nonnegative integers. For any positive integer $k$ and any subset $A$ of nonnegative integers, let $r_{1,k}(A,n)$ be the number of solutions $(a_1,a_2)$ to the equation $n=a_1+ka_2$. In 2016, Qu proved…

Number Theory · Mathematics 2023-09-12 Shi--Qiang Chen , Yuchen Ding , Xiaodong Lü , Yuhan Zhang

The main result of this paper is the following: for all $b \in \mathbb Z$ there exists $k=k(b)$ such that \[ \max \{ |A^{(k)}|, |(A+u)^{(k)}| \} \geq |A|^b, \] for any finite $A \subset \mathbb Q$ and any non-zero $u \in \mathbb Q$. Here,…

Number Theory · Mathematics 2020-09-22 Brandon Hanson , Oliver Roche-Newton , Dmitrii Zhelezov

Let $k$ be a number field. We provide an asymptotic formula for the number of Galois extensions of $k$ with absolute discriminant bounded by some $X \geq 1$, as $X\to\infty$. We also provide an asymptotic formula for the closely related…

Number Theory · Mathematics 2024-06-07 Robert J. Lemke Oliver

We fix a maximal order $\mathcal O$ in $\F=\R,\C$ or $\mathbb{H}$, and an $\F$-hermitian form $Q$ of signature $(n,1)$ with coefficients in $\mathcal O$. Let $k\in\N$. By applying a lattice point theorem on the $\F$-hyperbolic space, we…

Number Theory · Mathematics 2014-01-03 Emilio A. Lauret

An augmented generalized happy function $S_{[c,b]}$ maps a positive integer to the sum of the squares of its base $b$ digits plus $c$. For $b\geq 2$ and $k \in \mathbb{Z}^+$, a $k$-desert base $b$ is a set of $k$ consecutive non-negative…

Number Theory · Mathematics 2019-08-07 Breeanne Baker Swart , Susan Crook , Helen G. Grundman , Laura Hall-Seelig , May Mei , Laurie Zack

We revisit staircases for words and prove several exact as well as asymptotic results for longest left-most staircase subsequences and subwords and staircase separation number, the latter being defined as the number of consecutive maximal…

Combinatorics · Mathematics 2019-08-06 Toufik Mansour , Reza Rastegar , Alexander Roitershtein