中文
相关论文

相关论文: Admissable sets do not exist for all parameters

200 篇论文

A new notion of thickness for subsets of $B[0,1]\subset \mathbb{R}^n$ called affine thickness is defined; this notion of thickness is a generalisation of Falconer-Yavicoli thickness and is adapted to be used in the study of certain sets…

度量几何 · 数学 2026-01-26 Richard A. Howat

For a subset $A$ of $\{1,2,\ldots,N\}^2$ of size $\alpha N^2$ we show existence of $(m,n)\neq(0,0)$ such that the set $A$ contains at least $(\alpha^3 - o(1))N^2$ triples of points of the form $(a,b)$, $(a+m,b+n)$, $(a-n,b+m)$. This answers…

组合数学 · 数学 2021-12-06 Vjekoslav Kovač

A cap set in projective or affine geometry over a finite field is a set of points no three of which are collinear. In this paper, we propose a new construction for complete cap sets that yields a cap set of size 124928 in the affine…

组合数学 · 数学 2026-01-26 Iskandar Karapetyana , Karen Karapetyana

We provide an upper bound of the size of a subset A of F_p^n that does not admit a k-star of 3-APs (three-term arithmetic progressions). Namely, the subset A is assumed to contain no configuration of k 3-APs, sharing the middle term, such…

组合数学 · 数学 2019-09-24 Masato Mimura , Norihide Tokushige

The Ramsey Choice principle for families of $n$-element sets, denoted $\mathrm{RC}_n$, states that every infinite set $X$ has an infinite subset $Y\subseteq X$ with a choice function on $[Y]^n := \{z\subseteq Y : |z| = n\}$. We investigate…

逻辑 · 数学 2023-06-02 Lorenz Halbeisen , Riccardo Plati , Saharon Shelah

Let $\mathcal{I}$ be an analytic P-ideal [respectively, a summable ideal] on the positive integers and let $(x_n)$ be a sequence taking values in a metric space $X$. First, it is shown that the set of ideal limit points of $(x_n)$ is an…

经典分析与常微分方程 · 数学 2018-11-27 Paolo Leonetti

Sets with many additive quadruples are guaranteed to have many additive octuples, by H\"{o}lder's inequality. Sets with not many more than this are said to be additively nonsmoothing. We give a new proof of a structural theorem for…

组合数学 · 数学 2011-04-15 Michael Bateman , Nets Hawk Katz

We prove in Theorem $2.2$ that the multiplicatively closed subset generated by at most two elements in the set of natural numbers $\mathbb{N}$ has arbitrarily large gaps by explicitly constructing large integer intervals with known prime…

数论 · 数学 2019-05-20 C. P. Anil Kumar

An old problem of Moser asks: how large of a union-free subfamily does every family of m sets have? A family of sets is called union-free if there are no three distinct sets in the family such that the union of two of the sets is equal to…

组合数学 · 数学 2011-03-17 Jacob Fox , Choongbum Lee , Benny Sudakov

We give a short proof that Strassen's asymptotic rank conjecture implies that for every $\varepsilon > 0$ there exists a $(3/2^{2/3} + \varepsilon)^n$-time algorithm for set cover on a universe of size $n$ with sets of bounded size. This…

计算复杂性 · 计算机科学 2023-11-07 Kevin Pratt

A (discrete) group is called amenable whenever there exists a finitely additive right invariant probablity measure on it. For Thompson's group $F$ the problem whether it is amenable is a long-standing open question. We consider presentation…

群论 · 数学 2023-04-11 Victor Guba

We show that every planar triangulation on $n>10$ vertices has a dominating set of size $n/7=n/3.5$. This approaches the $n/4$ bound conjectured by Matheson and Tarjan [MT'96], and improves significantly on the previous best bound of…

组合数学 · 数学 2023-10-24 Aleksander B. G. Christiansen , Eva Rotenberg , Daniel Rutschmann

An accessing set in a graph is a subset B of vertices such that there exists D subset of B, such that each vertex of V\B has an even number of neighbors in D. In this paper, we introduce new bounds on the minimal size kappa'(G) of an…

计算复杂性 · 计算机科学 2011-10-05 Sylvain Gravier , Jérôme Javelle , Mehdi Mhalla , Simon Perdrix

In this paper, we introduce the nonstandard vector space in which the concept of additive inverse element will not be taken into account. We also consider a metric defined on this nonstandard vector space. Under these settings, the…

综合数学 · 数学 2013-07-15 Hsien-Chung Wu

A set-system $S\subseteq \{0,1\}^n$ is cube-ideal if its convex hull can be described by capacity and generalized set covering inequalities. In this paper, we use combinatorics, convex geometry, and polyhedral theory to give exponential…

组合数学 · 数学 2026-04-21 Ahmad Abdi , Gérard Cornuéjols , Daniel Dadush , Mahsa Dalirrooyfard

A set of integers is sum-free if it contains no solution to the equation $x+y=z$. We study sum-free subsets of the set of integers $[n]=\{1,\ldots,n\}$ for which the integer $2n+1$ cannot be represented as a sum of their elements. We prove…

组合数学 · 数学 2018-12-27 Ishay Haviv

According to a classical result of Szemer\'{e}di, every dense subset of $1,2,...,N$ contains an arbitrary long arithmetic progression, if $N$ is large enough. Its analogue in higher dimensions due to F\"urstenberg and Katznelson says that…

组合数学 · 数学 2010-04-13 Adrian Dumitrescu

In this paper, we consider the isoperimetric problem in the space $\mathbb{R}^N$ with density. Our result states that, if the density f is l.s.c. and converges to a positive limit at infinity, being smaller than this limit far from the…

偏微分方程分析 · 数学 2014-11-20 Guido De Philippis , Giovanni Franzina , Aldo Pratelli

A pinnacle of a permutation is a value that is larger than its immediate neighbors when written in one-line notation. In this paper, we build on previous work that characterized admissible pinnacle sets of permutations. For these sets,…

组合数学 · 数学 2021-03-12 Irena Rusu , Bridget Eileen Tenner

Consider a matrix $M$ chosen uniformly at random from a class of $m \times n$ matrices of zeros and ones with prescribed row and column sums. A partially filled matrix $D$ is a $\mathit{defining}$ $\mathit{set}$ for $M$ if $M$ is the unique…

组合数学 · 数学 2020-06-26 Carly Bodkin , Anita Liebenau , Ian M. Wanless