English
Related papers

Related papers: Cardinalities of $g$-difference sets

200 papers

Let $r_k(n)$ denote the maximum cardinality of a set $A \subset \{1,2, \dots, n \}$ such that $A$ does not contain a $k$-term arithmetic progression. In this paper, we give a method of constructing such a set and prove the lower bound…

Combinatorics · Mathematics 2017-11-21 Vladislav Taranchuk

We compute the cardinality $\mathfrak n_{\dim}(\mathcal M)$ of the sets of dimension functions on the ordered structures $\mathcal M$. The inequality $\mathfrak n_{\dim}(\mathcal M) \leq 1$ holds if $\mathcal M$ is a d-minimal expansion of…

Logic · Mathematics 2026-02-10 Masato Fujita

Let $G$ be the alternating group of degree $n$. Let $\omega(G)$ be the maximal size of a subset $S$ of $G$ such that $\langle x,y \rangle = G$ whenever $x,y \in S$ and $x \neq y$ and let $\sigma(G)$ be the minimal size of a family of proper…

Group Theory · Mathematics 2022-06-24 Francesco Fumagalli , Martino Garonzi , Pietro Gheri

Let f_1,f_2,..., be functions chosen independently and uniformly from the set of all functions from a set of cardinality n into itself. Let g_t be the composition of the first t functions, and let T be the smallest t for which g_t is…

Combinatorics · Mathematics 2007-05-23 W. M. Y. Goh , P. Hitczenko , E. Schmutz

We prove two $\mathrm{ZFC}$ inequalities between cardinal invariants. The first inequality involves cardinal invariants associated with an analytic P-ideal, in particular the ideal of subsets of $\omega$ of asymptotic density $0$. We obtain…

Logic · Mathematics 2015-05-26 Dilip Raghavan , Saharon Shelah

Answering affirmatively a 2007 problem of Chen, the first author proved that there is a unique representation basis $A$ of $\mathbb{Z}$ and a constant $c>0$ such that $$ A(-x,x)\ge c\sqrt{x} $$ for infinitely many positive integers $x$,…

Number Theory · Mathematics 2026-02-10 Yuchen Ding , Jie Wang

We study the consistency and consistency strength of various configurations concerning the cardinal characteristics $\mathfrak{s}_\theta,\mathfrak{p}_\theta,\mathfrak{g}_\theta,\mathfrak{r}_\theta,\mathfrak{t}_\theta$ at uncountable regular…

Logic · Mathematics 2021-02-02 Omer Ben-Neria , Shimon Garti

Let $(a_n)_{n \geq 1}$ be a sequence of distinct positive integers. In a recent paper Rudnick established asymptotic upper bounds for the minimal gaps of $\{a_n \alpha \bmod 1, 1 \leq n \leq N\}$ as $N \to \infty$, valid for Lebesgue-almost…

Number Theory · Mathematics 2021-08-09 Christoph Aistleitner , Daniel El-Baz , Marc Munsch

Given a function $f \in \omega^\omega$, a set $A \in [\omega]^\omega$ is free for $f$ if $f[A] \cap A$ is finite. For a class of functions $\Gamma \subseteq \omega^{\omega}$, we define $\mathfrak{ros}_\Gamma$ as the smallest size of a…

Logic · Mathematics 2024-04-11 Arturo Martínez-Celis , Tomasz Żuchowski

We study the existence of weak solutions of (E) $ (-\Delta)^\alpha u+g(u)=\nu $ in a bounded regular domain $\Omega$ in $\R^N (N\ge2)$ which vanish on $\R^N\setminus\Omega$, where $(-\Delta)^\alpha$ denotes the fractional Laplacian with…

Analysis of PDEs · Mathematics 2013-05-16 Huyuan Chen , Laurent Veron

In this work, first we prove that for any compact set $K\subset\mathbb{R}^{n}$ and any continuous function $\phi$ defined on $\partial K$, there exists a bounded weak solution in $C(\bar{\mathbb{R}^{n}\backslash K}) \cap…

Analysis of PDEs · Mathematics 2022-08-25 Leonardo Prange Bonorino , Lucas Pinto Dutra , Filipe Jung dos Santos

An important classical result in ZFC asserts that every infinite cardinal number is idempotent. Using this fact, we obtain several algebraic results in this article. The first result asserts that an infinite Abelian group has a proper…

Commutative Algebra · Mathematics 2024-09-05 Abolfazl Tarizadeh

An ordered set $S$ of vertices of a graph $G$ is a resolving set for $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The metric dimension of G is the minimum cardinality of a resolving set. In…

Combinatorics · Mathematics 2024-05-09 Mercè Mora , María José Souto Salorio , Ana Dorotea Tarrío-Tobar

Every infinite group $G$ of regular cardinality can be partitioned $G=A_1\cup A_2$ so that $G\neq FA_1$, $G\neq FA_2$ for every subset $F\subset G$ of cardinality $|F|<|G|$. The first author asked whether the same is true for each group $G$…

Group Theory · Mathematics 2014-08-26 Igor Protasov , Sergii Slobodianiuk

For nonnegative integers $q,n,d$, let $A_q(n,d)$ denote the maximum cardinality of a code of length $n$ over an alphabet $[q]$ with $q$ letters and with minimum distance at least $d$. We consider the following upper bound on $A_q(n,d)$. For…

Combinatorics · Mathematics 2018-08-07 Bart Litjens , Sven Polak , Alexander Schrijver

We prove the joints conjecture, showing that for any $N$ lines in ${\Bbb R}^3$, there are at most $O(N^{{3 \over 2}})$ points at which 3 lines intersect non-coplanarly. We also prove a conjecture of Bourgain showing that given $N^2$ lines…

Combinatorics · Mathematics 2008-12-08 Larry Guth , Nets Hawk Katz

In this paper, we consider certain cardinals in ZF (set theory without AC, the Axiom of Choice). In ZFC (set theory with AC), given any cardinals C and D, either C <= D or D <= C. However, in ZF this is no longer so. For a given infinite…

Logic · Mathematics 2016-09-06 Lorenz Halbeisen , Saharon Shelah

It is shown that the maximum of $|\zeta(1/2+it)|$ on the interval $T^{1/2}\le t \le T$ is at least $\exp\left((1/\sqrt{2}+o(1)) \sqrt{\log T \log\log\log T/\log\log T}\right)$. Our proof uses Soundararajan's resonance method and a certain…

Number Theory · Mathematics 2017-10-18 Andriy Bondarenko , Kristian Seip

In this paper we study existence of ground state solution to the following problem $$ (- \Delta)^{\alpha}u = g(u) \ \ \mbox{in} \ \ \mathbb{R}^{N}, \ \ u \in H^{\alpha}(\mathbb R^N) $$ where $(-\Delta)^{\alpha}$ is the fractional Laplacian,…

Analysis of PDEs · Mathematics 2016-10-18 Claudianor O. Alves , Giovany M. Figueiredo , Gaetano Siciliano

A subset $D \subseteq V $of a graph $G = (V, E)$ is a $(1, j)$-set if every vertex $v \in V \setminus D$ is adjacent to at least $1$ but not more than $j$ vertices in D. The cardinality of a minimum $(1, j)$-set of $G$, denoted as…

Discrete Mathematics · Computer Science 2014-10-14 Arijit Bishnu , Kunal Dutta , Arijit Ghosh , Subhabrata Paul