中文
相关论文

相关论文: On subsets of the hypercube with prescribed Hammin…

200 篇论文

In the spirit of the Genetics of the Regular Figures, by L. Fejes T\'oth, we prove the following theorem: If $2n$ points are selected in the $n$-dimensional Euclidean ball $B^n$ so that the smallest distance between any two of them is as…

度量几何 · 数学 2007-05-23 Wlodzimierz Kuperberg

Given a set C in R^d, let p(C) be the probability that a random d-dimensional unimodular lattice, chosen according to Haar measure on SL(d,Z)\SL(d,R), is disjoint from C\{0}. For special convex sets C we prove bounds on p(C) which are sharp…

数论 · 数学 2014-02-26 Andreas Strömbergsson

We prove that any graph $G$ of minimum degree greater than $2k^2-1$ has a $(k+1)$-connected induced subgraph $H$ such that the number of vertices of $H$ that have neighbors outside of $H$ is at most $2k^2-1$. This generalizes a classical…

组合数学 · 数学 2016-11-04 Irena Penev , Stéphan Thomassé , Nicolas Trotignon

Let X be a set definable in a sharply o-minimal structure. We consider the problem of counting the number of points where X intersects algebraic varieties V over Q of dimension k < codim X, as a function of T := deg(V) + h(V), where h(V) is…

We prove a version of the Erd\H{o}s--Beck Theorem from discrete geometry for fractal sets in all dimensions. More precisely, let $X\subset \mathbb{R}^n$ Borel and $k \in [0, n-1]$ be an integer. Let $\dim (X \setminus H) = \dim X$ for every…

经典分析与常微分方程 · 数学 2024-06-17 Paige Bright , Caleb Marshall

A family of axis-aligned boxes in $\er^d$ is \emph{$k$-neighborly} if the intersection of every two of them has dimension at least $d-k$ and at most $d-1$. Let $n(k,d)$ denote the maximum size of such a family. It is known that $n(k,d)$ can…

Let $\gamma(G)$ and $i(G)$ be the domination number and the independent domination number of $G$, respectively. Rad and Volkmann posted a conjecture that $i(G)/ \gamma(G) \leq \Delta(G)/2$ for any graph $G$, where $\Delta(G)$ is its maximum…

组合数学 · 数学 2016-07-08 Shaohui Wang , Bing Wei

The main motivation for this article is to explore the connections between the existence of certain combinatorial patterns (as in van der Corputs's theorem on arithmetic progressions of length $3$) with well-known tools and theorems for…

逻辑 · 数学 2026-03-18 Amador Martin-Pizarro , Daniel Palacín

The famous Erdos-Heilbronn conjecture plays an important role in the development of additive combinatorics. In 2007 Z. W. Sun made the following further conjecture (which is the linear extension of the Erdos-Heilbronn conjecture): For any…

数论 · 数学 2011-10-13 Zhi-Wei Sun , Li-Lu Zhao

Freiman's theorem gives a lower bound for the cardinality of the doubling of a finite set in $\RR^n$. In this paper we give an interpretation of his theorem for monomial ideals and their fiber cones. We call a quasi-equigenerated monomial…

交换代数 · 数学 2018-01-17 Jürgen Herzog , Takayuki Hibi , Guangjun Zhu

This article explores the model-dependent nature of set cardinality, emphasizing that cardinality is not absolute but varies across different axiomatic frameworks. Although Cantor's diagonal argument shows the real numbers are…

We prove a theorem describing the limiting fine-scale statistics of orbits of a point in hyperbolic space under the action of a discrete subgroup. Similar results have been proved only in the lattice case, with two recent infinite-volume…

动力系统 · 数学 2023-06-22 Christopher Lutsko

Hindman's celebrated Finite Sums Theorem, and its high-dimensional version due to Milliken and Taylor, are extended from covers of countable sets to covers of arbitrary topological spaces with Menger's classic covering property. The methods…

一般拓扑 · 数学 2017-11-09 Boaz Tsaban

We define certain arithmetic derivatives on $\mathbb{Z}$ that respect the Leibniz rule, are additive for a chosen equation $a+b=c$, and satisfy a suitable non-degeneracy condition. Using Geometry of Numbers, we unconditionally show their…

数论 · 数学 2021-12-14 Hector Pasten

We study distributed protocols for finding all pairs of similar vectors in a large dataset. Our results pertain to a variety of discrete metrics, and we give concrete instantiations for Hamming distance. In particular, we give improved…

数据结构与算法 · 计算机科学 2016-11-16 Paul Beame , Cyrus Rashtchian

The Burton--Keane theorem for the almost-sure uniqueness of infinite clusters is a landmark of stochastic geometry. Let $\mu$ be a translation-invariant probability measure with the finite-energy property on the edge-set of a…

概率论 · 数学 2007-05-23 Geoffrey Grimmett

Research on Helly-type theorems in combinatorial convex geometry has produced volumetric versions of Helly's theorem using witness sets and quantitative extensions of Doignon's theorem. This paper combines these philosophies and presents…

组合数学 · 数学 2021-05-10 Travis Dillon

The Cannon Conjecture from the geometric group theory asserts that a word hyperbolic group that acts effectively on its boundary, and whose boundary is homeomorphic to the 2-sphere, is isomorphic to a Kleinian group. We prove the following…

几何拓扑 · 数学 2012-10-29 Vladimir Markovic

The Caccetta-Haggkvist conjecture states that if G is a finite directed graph with at least n/k edges going out of each vertex, then G contains a directed cycle of length at most k. Hamidoune used methods and results from additive number…

组合数学 · 数学 2016-12-30 Melvyn B. Nathanson

The celebrated Erd\H{o}s-Hajnal Conjecture says that in any proper hereditary class of finite graphs we are guaranteed to have a clique or anti-clique of size $n^c$, which is a much better bound than the logarithmic size that is provided by…

组合数学 · 数学 2022-09-20 Leonardo N. Coregliano , Maryanthe Malliaris