English
Related papers

Related papers: Weak and Strong Nestings of BIBDs

200 papers

In a nesting of a balanced incomplete block design (or BIBD), we wish to add a point (the \emph{nested point}) to every block of a $(v,k,\lambda)$-BIBD in such a way that we end up with a partial $(v,k+1,\lambda+1)$-BIBD. In the case where…

Combinatorics · Mathematics 2024-04-04 Marco Buratti , Donald L. Kreher , Douglas R. Stinson

A $(v,k,\lambda)$-BIBD $(X,\mathcal B)$ can be nested if there is a mapping $\phi:\mathcal B\rightarrow X$ such that $(X,\{B\cup\{\phi(B)\}\mid B\in\mathcal B\})$ is a $(v,k+1,\lambda+1)$-packing. A $(v,k,\lambda)$-BIBD has a (perfect)…

Combinatorics · Mathematics 2024-05-24 Xinyue Ming , Tao Feng , Menglong Zhang

We give explicit constructions for incomplete pairwise balanced designs IPBD$((v;w),K)$, or, equivalently, edge-decompositions of a difference of two cliques $K_v \setminus K_w$ into cliques whose sizes belong to the set $K$. Our…

Combinatorics · Mathematics 2018-09-24 Peter J. Dukes , Esther R. Lamken

Balanced incomplete block designs (BIBDs) are a class of designs with v treatments and b blocks of size k that are optimal with regards to a wide range of optimality criteria, but it is not clear which designs to choose for combinations of…

Statistics Theory · Mathematics 2019-02-13 Sera Aylin Cakiroglu , Peter J Cameron

Gradient coding is a coding theoretic framework to provide robustness against slow or unresponsive machines, known as stragglers, in distributed machine learning applications. Recently, Kadhe et al. proposed a gradient code based on a…

Information Theory · Computer Science 2022-01-28 Animesh Sakorikar , Lele Wang

In these notes we investigate BIBDs with $\lambda=1$ that present subdesigns evenly covering both blocks and vertices: we determine some of their basic properties, consequence of already existing results in the literature, with regards to…

Combinatorics · Mathematics 2018-09-06 Daniele Dona

Bose proved the inequality $b\geq v+r-1$ for resolvable balanced incomplete block designs (RBIBDs) and Kageyama improved it for RBIBDs which are not affine resolvable. In this note we prove a new lower bound on the number of blocks $b$ that…

Combinatorics · Mathematics 2015-06-02 Muhammad Ali Khan

We construct a `weak' version EM^w(K) of Lack & Street's 2-category of monads in a 2-category K, by replacing their compatibility constraint of 1-cells with the units of monads by an additional condition on the 2-cells. A relation between…

Category Theory · Mathematics 2012-01-27 Gabriella Böhm

We prove three theorems giving extremal bounds on the incidence structures determined by subsets of the points and blocks of a balanced incomplete block design (BIBD). These results generalize and strengthen known bounds on the number of…

Combinatorics · Mathematics 2016-12-28 Ben Lund , Shubhangi Saraf

Based on the novel notion of `weakly counital fusion morphism', regular weak multiplier bimonoids in braided monoidal categories are introduced. They generalize weak multiplier bialgebras over fields and multiplier bimonoids in braided…

Category Theory · Mathematics 2019-07-08 Gabriella Böhm , José Goméz-Torrecillas , Stephen Lack

Many biological, ecological and economic systems are best described by weighted networks, as the nodes interact with each other with varying strength. However, most network models studied so far are binary, the link strength being either 0…

Disordered Systems and Neural Networks · Physics 2009-11-07 S. H. Yook , H. Jeong , A. -L. Barabasi , Y. Tu

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 set of integers $S \subset \mathbb{N}$ is an $\alpha$-strong Sidon set if the pairwise sums of its elements are far apart by a certain measure depending on $\alpha$, more specifically if $| (x+w) - (y+z) | \geq \max \{…

Combinatorics · Mathematics 2019-12-09 David Fabian , Juanjo Rué , Christoph Spiegel

We study the simultaneous embeddability of a pair of partitions of the same underlying set into disjoint blocks. Each element of the set is mapped to a point in the plane and each block of either of the two partitions is mapped to a region…

Computational Geometry · Computer Science 2014-08-27 Jan Christoph Athenstädt , Tanja Hartmann , Martin Nöllenburg

We consider a statistical problem to estimate variables (effects) that are associated with the edges of a complete bipartite graph $K_{v_1, v_2}=(V_1, V_2 \, ; E)$. Each data is obtained as a sum of selected effects, a subset of $E$. In…

Combinatorics · Mathematics 2023-09-01 Shoko Chisaki , Ryoh Fuji-Hara , Nobuko Miyamoto

We give a quantitative characterization of the pairs of weights $(w,v)$ for which the dyadic version of the one-sided Hardy-Littlewood maximal operator satisfies a restricted weak $(p,p)$ type inequality, for $1\leq p<\infty$. More…

Classical Analysis and ODEs · Mathematics 2021-05-25 Fabio Berra

This paper studies problems related to visibility among points in the plane. A point $x$ \emph{blocks} two points $v$ and $w$ if $x$ is in the interior of the line segment $\bar{vw}$. A set of points $P$ is \emph{$k$-blocked} if each point…

Combinatorics · Mathematics 2015-11-17 Greg Aloupis , Brad Ballinger , Sébastien Collette , Stefan Langerman , Attila Pór , David R. Wood

In this article we investigate a special class of non-doubling metric measure spaces in order to describe the possible configurations of $P_{k,\rm s}^{\rm c}$, $P_{k,\rm s}$, $P_{k,\rm w}^{\rm c}$ and $P_{k,\rm w}$, the sets of all $p \in…

Classical Analysis and ODEs · Mathematics 2019-03-29 Dariusz Kosz

We study necessary and sufficient conditions for contraction and incremental stability of dynamical systems with respect to non-Euclidean norms. First, we introduce weak pairings as a framework to study contractivity with respect to…

Optimization and Control · Mathematics 2022-08-02 Alexander Davydov , Saber Jafarpour , Francesco Bullo

In this paper we present three different results dealing with the number of $(\leq k)$-facets of a set of points: 1. We give structural properties of sets in the plane that achieve the optimal lower bound $3\binom{k+2}{2}$ of $(\leq…

Combinatorics · Mathematics 2020-07-21 Oswin Aichholzer , Jesús García , David Orden , Pedro Ramos
‹ Prev 1 2 3 10 Next ›