中文
相关论文

相关论文: Distinct volume subsets

200 篇论文

In this paper we study $N_d(k)$ the smallest positive integer such that any nice measure $\mu$ in $\R^d$ can be partitioned in $N_d(k)$ parts of equal measure so that every hyperplane avoids at least $k$ of them. A theorem of Yao and Yao…

度量几何 · 数学 2021-06-09 Edgardo Roldán-Pensado , Pablo Soberón

We consider finite simple graphs. Given a graph $H$ and a positive integer $n,$ the Tur\'{a}n number of $H$ for the order $n,$ denoted ${\rm ex}(n,H),$ is the maximum size of a graph of order $n$ not containing $H$ as a subgraph. Erd\H{o}s…

组合数学 · 数学 2020-02-03 Pu Qiao , Xingzhi Zhan

Let $P_{d}(n)$ denote the number of $n \times \ldots \times n$ $d$-dimensional partitions with entries from $\left\{0,1,\ldots,n\right\}$. Building upon the works of Balogh-Treglown-Wagner and Noel-Scott-Sudakov, we show that when $d \to…

组合数学 · 数学 2024-02-28 Cosmin Pohoata , Dmitriy Zakharov

When $g\in\mathbb{N}$ we say that $A\subset\mathbb{N}$ is a $B_{2}[g]$ sequence if every $m\in\mathbb{N}$ has at most $g$ distinct representations of the shape $m=b_{1}+b_{2}$ with $b_{1}\leq b_{2}$ and $b_{1},b_{2}\in A$. We show for every…

数论 · 数学 2024-05-08 Javier Pliego

The present paper develops two concepts of pointwise differentiability of higher order for arbitrary subsets of Euclidean space defined by comparing their distance functions to those of smooth submanifolds. Results include that…

微分几何 · 数学 2019-04-11 Ulrich Menne

We formulate and give partial answers to several combinatorial problems on volumes of simplices determined by $n$ points in 3-space, and in general in $d$ dimensions. (i) The number of tetrahedra of minimum (nonzero) volume spanned by $n$…

组合数学 · 数学 2013-12-17 Csaba D. Toth , Adrian Dumitrescu

Let $K$ be a $d$ dimensional convex body with a twice continuously differentiable boundary and everywhere positive Gauss-Kronecker curvature. Denote by $K_n$ the convex hull of $n$ points chosen randomly and independently from $K$ according…

度量几何 · 数学 2015-02-25 Imre Bárány , Ferenc Fodor , Viktor Vígh

We study divisibility properties of certain sums and alternating sums involving binomial coefficients and powers of integers. For example, we prove that for all positive integers $n_1,..., n_m$, $n_{m+1}=n_1$, and any nonnegative integer…

数论 · 数学 2012-04-10 Victor J. W. Guo , Jiang Zeng

A subset of the Hamming cube over $n$-letter alphabet is said to be $d$-maximal if its diameter is $d$, and adding any point increases the diameter. Our main result shows that each $d$-maximal set is either of size at most $(n+o(n))^d$ or…

组合数学 · 数学 2025-07-16 Boris Bukh , Aleksandre Saatashvili

It is a well known result due to Korshunov and Sapozhenko that the hypercube in $n$ dimensions has $(1 + o(1)) \cdot 2 \sqrt e \cdot 2^{2^{n-1}}$ independent sets. Jenssen and Keevash investigated in depth Cartesian powers of cycles of…

组合数学 · 数学 2023-10-05 Patrick Arras , Felix Joos

The Erd\H os unit distance conjecture in the plane says that the number of pairs of points from a point set of size $n$ separated by a fixed (Euclidean) distance is $\leq C_{\epsilon} n^{1+\epsilon}$ for any $\epsilon>0$. The best known…

经典分析与常微分方程 · 数学 2017-09-26 Alex Iosevich

We study open point sets in Euclidean spaces $\mathbb{R}^d$ without a pair of points an integral distance apart. By a result of Furstenberg, Katznelson, and Weiss such sets must be of Lebesgue upper density zero. We are interested in how…

度量几何 · 数学 2015-03-20 Sascha Kurz , Valery Mishkin

Pilz's conjecture states that for any finite set $A=\{a_1,a_2,\dots,a_k\}$ of positive integers and positive integer $n$ in the union of the sets $\{a_1,2a_1,\dots,na_1\},\dots, \{a_k,2a_k,\dots,na_k\}$ (considered as a multiset) at least…

组合数学 · 数学 2024-09-24 János Nagy , Péter Pál Pach

A cutset is a non-empty finite subset of $\mathbb{Z}^d$ which is both connected and co-connected. A cutset is odd if its vertex boundary lies in the odd bipartition class of $\mathbb{Z}^d$. Peled suggested that the number of odd cutsets…

组合数学 · 数学 2016-09-06 Ohad Noy Feldheim , Yinon Spinka

For a positive integer $d$, a set of points in $d$-dimensional Euclidean space is called almost-equidistant if for any three points from the set, some two are at unit distance. Let $f(d)$ denote the largest size of an almost-equidistant set…

度量几何 · 数学 2020-02-25 Martin Balko , Attila Pór , Manfred Scheucher , Konrad Swanepoel , Pavel Valtr

Let $p$ be a prime number, and let $S$ be the numerical semigroup generated by the prime numbers not less than $p$. We compare the orders of magnitude of some invariants of $S$ with each other, e. g., the biggest atom $u$ of $S$ with $p$…

数论 · 数学 2024-06-11 Michael Hellus , Anton Rechenauer , Rolf Waldi

For two sets $A$ and $M$ of positive integers and for a positive integer $n$, let $p(n,A,M)$ denote the number of partitions of $n$ with parts in $A$ and multiplicities in $M$, that is, the number of representations of $n$ in the form…

组合数学 · 数学 2012-07-16 Noga Alon

Let $k,d,\lambda\geqslant1$ be integers with $d\geqslant\lambda $. Let $m(k,d,\lambda)$ be the maximum positive integer $n$ such that every set of $n$ points (not necessarily in general position) in $\mathbb{R}^{d}$ has the property that…

We study the set D of positive integers d for which the equation $\phi(a)-\phi(b)=d$ has infinitely many solution pairs (a,b), where $\phi$ is Euler's totient function. We show that the minumum of D is at most 154, exhibit a specific A so…

数论 · 数学 2022-07-05 Kevin Ford , Sergei Konyagin

For positive integers $n$ and $m$, consider a multiset of non-empty subsets of $[m]$ such that there is a \textit{unique} partition of these subsets into $n$ partitions of $[m]$. We study the maximum possible size $g(n,m)$ of such a…

组合数学 · 数学 2022-09-02 Varun Sivashankar