English
Related papers

Related papers: Pairwise balanced designs covered by bounded flats

200 papers

We consider $d$-dimensional simplicial complexes which can be PL embedded in the $2d$-dimensional euclidean space. In short, we show that in any such complex, for any three vertices, the intersection of the link-complexes of the vertices is…

Computational Geometry · Computer Science 2020-01-28 Salman Parsa

We say that a linear space is harmonious if it is resolvable and admits an automorphism group acting sharply transitively on the points and transitively on the parallel classes. Generalizing old results by the first author et al. we present…

Combinatorics · Mathematics 2023-03-22 Marco Buratti , Dieter Jungnickel

Let $A,B \subseteq \mathbb{R}^d $ both span $\mathbb{R}^d$ such that $\langle a, b \rangle \in \{0,1\}$ holds for all $a \in A$, $b \in B$. We show that $ |A| \cdot |B| \le (d+1) 2^d $. This allows us to settle a conjecture by Bohn, Faenza,…

Combinatorics · Mathematics 2020-08-18 Andrey Kupavskii , Stefan Weltge

The problem of constrained $k$-center clustering has attracted significant attention in the past decades. In this paper, we study balanced $k$-center cluster where the size of each cluster is constrained by the given lower and upper bounds.…

Computational Geometry · Computer Science 2017-04-11 Hu Ding

A basic problem in constant dimension subspace coding is to determine the maximal possible size ${\bf A}_q(n,d,k)$ of a set of $k$-dimensional subspaces in ${\bf F}_q^n$ such that the subspace distance satisfies…

Information Theory · Computer Science 2020-08-25 Huimin Lao , Hao Chen , Jian Weng , Xiaoqing Tan

In 2008, Bukh, Matousek, and Nivasch conjectured that for every n-point set S in R^d and every k, 0 <= k <= d-1, there exists a k-flat f in R^d (a "centerflat") that lies at "depth" (k+1) n / (k+d+1) - O(1) in S, in the sense that every…

Computational Geometry · Computer Science 2012-05-03 Boris Bukh , Gabriel Nivasch

Given a planar point set and an integer $k$, we wish to color the points with $k$ colors so that any axis-aligned strip containing enough points contains all colors. The goal is to bound the necessary size of such a strip, as a function of…

Computational Geometry · Computer Science 2011-04-08 G. Aloupis , J. Cardinal , S. Collette , S. Imahori , M. Korman , S. Langerman , O. Schwartz , S. Smorodinsky , P. Taslakian

We consider a generalization of the notion of partially balanced incomplete block designs (PBIBDs), by relaxing the requirement that the underlying association scheme be commutative. An infinite family of such generalizations is…

Combinatorics · Mathematics 2021-11-02 Daniel Kalmanovich

Let $S$ be a set of $r$ red points and $b=r+2d$ blue points in general position in the plane, with $d\geq 0$. A line $\ell$ determined by them is said to be balanced if in each open half-plane bounded by $\ell$ the difference between the…

Combinatorics · Mathematics 2020-07-21 David Orden , Pedro Ramos , Gelasio Salazar

Recent researches on designs for computer experiments with both qualitative and quantitative factors have advocated the use of marginally coupled designs. This paper proposes a general method of constructing such designs for which the…

Methodology · Statistics 2022-03-15 Yuanzhen He , C. Devon Lin , Fasheng SUn

Given positive integers $v$, $k$, $t$ and $\lambda$ with $v \geq k \geq t$, a packing design PD$_{\lambda}(v,k,t)$ is a pair $(V,\mathcal{B})$, where $V$ is a $v$-set and $\mathcal{B}$ is a collection of $k$-subsets of $V$ such that each…

Combinatorics · Mathematics 2025-07-18 Andrea C. Burgess , Peter Danziger , Daniel Horsley , Muhammad Tariq Javed

In $d$-dimensional space (over any field), given a set of lines, a joint is a point passed through by $d$ lines not all lying in some hyperplane. The joints problem asks to determine the maximum number of joints formed by $L$ lines, and it…

Combinatorics · Mathematics 2024-11-22 Hung-Hsun Hans Yu , Yufei Zhao

The paper explores the correspondence between balanced incomplete block designs (BIBD) and certain linear CNF formulas by identifying the points of a block design with the clauses of the Boolean formula and blocks with Boolean variables.…

Computational Complexity · Computer Science 2020-10-08 Bernd. R. Schuh

A subgroup H of G=(Z/dZ)^* is called balanced if every coset of H is evenly distributed between the lower and upper halves of G, i.e., has equal numbers of elements with representatives in (0,d/2) and (d/2,d). This notion has applications…

Number Theory · Mathematics 2012-05-01 Carl Pomerance , Douglas Ulmer

In this article, we investigate collections of `well-spread-out' projective (and linear) subspaces. Projective $k$-subspaces in $\mathsf{PG}(d,\mathbb{F})$ are in `higgledy-piggledy arrangement' if they meet each projective subspace of…

Combinatorics · Mathematics 2014-09-23 Szabolcs L. Fancsali , Péter Sziklai

Motivated by topological Tverberg-type problems and by classical results about embeddings (maps without double points), we study the question whether a finite simplicial complex K can be mapped into R^d without triple, quadruple, or, more…

Geometric Topology · Mathematics 2015-08-13 Isaac Mabillard , Uli Wagner

For given positive integers $d$ and $m$, consider the projective klt pairs $(X,B)$ of dimension $d$, of Cartier index $m$, and with semi-ample $K_X+B$ defining a contraction $\pi\colon X\to Z$. We prove that it is not possible in general to…

Algebraic Geometry · Mathematics 2023-05-16 Yuto Masamura

A $(d-1)$-dimensional simplicial complex $\Delta$ is balanced if its graph $G(\Delta)$ is $d$-colorable. Klee and Novik obtained the balanced lower bound theorem for balanced normal $(d-1)$-pseudomanifolds $\Delta$ with $d\geq3$ by showing…

Combinatorics · Mathematics 2023-10-10 Ryoshun Oba

We show that if $D \subset \mathbb P^N$ is obtained from a codimension two local complete intersection $C$ by adding embedded points of multiplicity $\leq 3$, then $D$ is a flat limit of $C$ and isolated points. As applications, we…

Algebraic Geometry · Mathematics 2012-11-21 Dawei Chen , Scott Nollet

The distances between flats of a Poisson $k$-flat process in the $d$-dimensional Euclidean space with $k<d/2$ are discussed. Continuing an approach originally due to Rolf Schneider, the number of pairs of flats having distance less than a…

Probability · Mathematics 2014-07-08 Matthias Schulte , Christoph Thaele
‹ Prev 1 3 4 5 6 7 10 Next ›