Results 1 to 10 of about 6,308,478 (20)
Union-intersecting set systems [PDF]
, 2014 Three intersection theorems are proved. First, we determine the size of the largest set system, where the system of the pairwise unions is l-intersecting.
Katona, Gyula O. H., Nagy, Dániel T.
core +3 more sources
Large Deviations for Brownian Intersection Measures [PDF]
, 2011 We consider $p$ independent Brownian motions in $\R^d$. We assume that $p\geq 2$ and $p(d-2)
Asselah +23 more
core +7 more sources
Systematic Codes for Rank Modulation [PDF]
, 2014 The goal of this paper is to construct systematic error-correcting codes for permutations and multi-permutations in the Kendall's $\tau$-metric. These codes are important in new applications such as rank modulation for flash memories. The construction is
Bruck, Jehoshua +3 more
core +2 more sources
Toral Algebraic Sets and Function Theory on Polydisks [PDF]
, 2005 A toral algebraic set $A$ is an algebraic set in $\C^n$ whose intersection with $\T^n$ is sufficiently large to determine the holomorphic functions on $A$.
Agler, Jim +2 more
core +3 more sources
Semi-algebraic Ramsey numbers [PDF]
, 2014 Given a finite point set $P \subset \mathbb{R}^d$, a $k$-ary semi-algebraic relation $E$ on $P$ is the set of $k$-tuples of points in $P$, which is determined by a finite number of polynomial equations and inequalities in $kd$ real variables.
Suk, Andrew
core +3 more sources
Intersecting families of discrete structures are typically trivial [PDF]
, 2015 The study of intersecting structures is central to extremal combinatorics. A family of permutations $\mathcal{F} \subset S_n$ is \emph{$t$-intersecting} if any two permutations in $\mathcal{F}$ agree on some $t$ indices, and is \emph{trivial} if all ...
Balogh, József +4 more
core +1 more source
The Paradox of Virtual Dipoles in the Einstein Action [PDF]
, 2000 The functional integral of pure Einstein 4D quantum gravity admits abnormally large and long-lasting "dipolar fluctuations", generated by virtual sources with the property Int d^4x Sqrt{g(x)} Tr T(x) = 0.
A. Ashtekar +18 more
core +2 more sources
Hausdorff measure of sets of Dirichlet non-improvable numbers
, 2017 Let $\psi:\mathbb R_+\to\mathbb R_+$ be a non-increasing function. A real number $x$ is said to be $\psi$-Dirichlet improvable if it admits an improvement to Dirichlet's theorem in the following sense: the system $$|qx-p|< \, \psi(t) \ \ {\text{and}} \ \
Hussain, Mumtaz +3 more
core +1 more source
Tur\'an numbers for $K_{s,t}$-free graphs: topological obstructions and algebraic constructions
, 2012 We show that every hypersurface in $\R^s\times \R^s$ contains a large grid, i.e., the set of the form $S\times T$, with $S,T\subset \R^s$. We use this to deduce that the known constructions of extremal $K_{2,2}$-free and $K_{3,3}$-free graphs cannot be ...
A. Yu. Volovikov +22 more
core +1 more source
Partitions of graphs into small and large sets [PDF]
, 2012 Let $G$ be a graph on $n$ vertices. We call a subset $A$ of the vertex set $V(G)$ \emph{$k$-small} if, for every vertex $v \in A$, $\deg(v) \le n - |A| + k$. A subset $B \subseteq V(G)$ is called \emph{$k$-large} if, for every vertex $u \in B$, $\deg(u) \
Bojilov, Asen +3 more
core +1 more source