中文
相关论文

相关论文: Incidence bounds on multijoints and generic joints

200 篇论文

When given a class of functions and a finite collection of sets, one might be interested whether the class in question contains any function whose domain is a subset of the union of the sets of the given collection and whose restrictions to…

逻辑 · 数学 2019-03-14 Dimiter Skordev

We say that a finite set S of points in R^d is in "strong general position" if for any collection {F_1,..., F_r} of r pairwise disjoint subsets of S (1 <= r <= |S|) we have: d-dim (the intersection of aff F_1,aff F_2,...,aff F_r) = min{d+1,…

组合数学 · 数学 2014-09-11 Micha A. Perles , Moriah Sigron

The celebrated Johnson-Lindenstrauss lemma states that for all $\varepsilon \in (0,1)$ and finite sets $X \subseteq \mathbb{R}^N$ with $n>1$ elements, there exists a matrix $\Phi \in \mathbb{R}^{m \times N}$ with…

度量几何 · 数学 2024-03-08 Rafael Chiclana , Mark A. Iwen , Mark Philip Roach

The category of all monads over many-sorted sets (and over other "set-like" categories) is proved to have coequalizers and strong cointersections. And a general diagram has a colimit whenever all the monads involved preserve monomorphisms…

计算机科学中的逻辑 · 计算机科学 2014-09-15 Jiří Adámek

Zeckendorf proved that every integer can be written uniquely as a sum of non-consecutive Fibonacci numbers $\{F_n\}$, and later researchers showed that the distribution of the number of summands needed for such decompositions of integers in…

Let $\mathcal{F}$ be a family of graphs. A graph $G$ is called \textit{$\mathcal{F}$-free} if for any $F\in \mathcal{F}$, there is no subgraph of $G$ isomorphic to $F$. Given a graph $T$ and a family of graphs $\mathcal{F}$, the generalized…

组合数学 · 数学 2021-02-22 Lin-Peng Zhang , Ligong Wang , Jiale Zhou

A packing of subsets $\mathcal S_1,..., \mathcal S_n$ in a group $G$ is a sequence $(g_1,...,g_n)$ such that $g_1\mathcal S_1,...,g_n\mathcal S_n$ are disjoint subsets of $G$. We give a formula for the number of packings if the group $G$ is…

组合数学 · 数学 2012-10-04 Roland Bacher

Let K(X) be the collection of all non-zero finite dimensional subspaces of rational functions on an n-dimensional irreducible variety X. For any n-tuple L_1,..., L_n in K(X), we define an intersection index [L_1,..., L_n] as the number of…

代数几何 · 数学 2010-01-06 Kiumars Kaveh , A. G. Khovanskii

We present a direct and fairly simple proof of the following incidence bound: Let $P$ be a set of $m$ points and $L$ a set of $n$ lines in ${\mathbb R}^d$, for $d\ge 3$, which lie in a common algebraic two-dimensional surface of degree $D$…

代数几何 · 数学 2015-06-03 Micha Sharir , Noam Solomon

A celebrated unit distance conjecture due to Erd\H os says that that the unit distances cannot arise more than $C_{\epsilon}n^{1+\epsilon}$ times (for any $\epsilon>0$) among $n$ points in the Euclidean plane (see e.g. \cite{SST84} and the…

组合数学 · 数学 2022-02-14 A. Gafni , A. Iosevich , E. Wyman

An $f$-subgroup is a linear recurring sequence subgroup, a multiplicative subgroup of a field whose elements can be generated (without repetition) by a linear recurrence relation, with characteristic polynomial $f$. It is called…

组合数学 · 数学 2021-03-26 Henk D. L. Hollmann , Medet Zhanbulatuly

Let $S$ be a finite set of points in the plane and let $\mathcal{T}(S)$ be the set of intersection points between pairs of lines passing through any two points in $S$. We characterize all configurations of points $S$ such that iteration of…

度量几何 · 数学 2007-05-23 Christopher J. Hillar , Darren L. Rhea

Let $x$ be a sequence taking values in a separable metric space and $\mathcal{I}$ be a generalized density ideal or an $F_\sigma$-ideal on the positive integers (in particular, $\mathcal{I}$ can be any Erd{\H o}s--Ulam ideal or any summable…

一般拓扑 · 数学 2019-06-13 Paolo Leonetti

We provide a construction of the fixed points of functors which may not be inital algebras or final coalgebras. For an endofunctor F, this fixed point construction may be expressed as a pair of adjoint functors between F-coalgebras and…

范畴论 · 数学 2023-03-06 Ezra Schoen , Jade Master , Clemens Kupke

We prove an incidence theorem for points and planes in the projective space $\mathbb P^3$ over any field $\mathbb F$, whose characteristic $p\neq 2.$ An incidence is viewed as an intersection along a line of a pair of two-planes from two…

组合数学 · 数学 2015-12-07 Misha Rudnev

A family $\mathcal F\subset 2^{[n]}$ is called intersecting if any two of its sets intersect. Given an intersecting family, its diversity is the number of sets not passing through the most popular element of the ground set. Peter Frankl…

组合数学 · 数学 2018-07-02 Andrey Kupavskii

For a wide class of sequences of integer domains $\mathcal{D}_n\subset\mathbb{N}^d$, $n\in\mathbb{N}$, we prove distributional limit theorems for $F(X_1^{(n)},\ldots,X_d^{(n)})$, where $F$ is a multivariate multiplicative function and…

概率论 · 数学 2023-02-01 Zakhar Kabluchko , Oleksandr Marynych , Kilian Raschel

Let $\mathcal{F}=\{F_1,F_2, \ldots,F_n\}$ be a family of $n$ sets on a ground set $S$, such as a family of balls in $\mathbb{R}^d$. For every finite measure $\mu$ on $S$, such that the sets of $\mathcal{F}$ are measurable, the classical…

组合数学 · 数学 2014-04-18 Xavier Goaoc , Jiří Matoušek , Pavel Paták , Zuzana Safernová , Martin Tancer

We consider factorizations of a finite group $G$ into conjugate subgroups, $G=A^{x_{1}}\cdots A^{x_{k}}$ for $A\leq G$ and $x_{1},\ldots ,x_{k}\in G$, where $A$ is nilpotent or solvable. First we exploit the split $BN$-pair structure of…

群论 · 数学 2015-03-09 Martino Garonzi , Dan Levy , Attila Maróti , Iulian I. Simion

Given a set of $n$ points in $R^2$, the Szemer\'edi-Trotter theorem establishes that the number of lines which can be incident to at least $k > 1$ of these points is $O(n^2/k^3 + n/k)$. J.\ Solymosi conjectured that if one requires the…

组合数学 · 数学 2014-07-31 G. Amirkhanyan , A. Bush , E. Croot , C. Pryby