English
Related papers

Related papers: A 910-block explicit construction guaranteeing a t…

200 papers

A cycle double cover (CDC) of an undirected graph is a collection of the graph's cycles such that every edge of the graph belongs to exactly two cycles. We describe a constructive method for generating all the cubic graphs that have a 6-CDC…

Discrete Mathematics · Computer Science 2009-04-17 Rodrigo S. C. Leao , Valmir C. Barbosa

Let $\mathcal{T}$ be a set of $n$ flat (planar) semi-algebraic regions in $\mathbb{R}^3$ of constant complexity (e.g., triangles, disks), which we call plates. We wish to preprocess $\mathcal{T}$ into a data structure so that for a query…

Computational Geometry · Computer Science 2025-03-18 Pankaj K. Agarwal , Boris Aronov , Esther Ezra , Matthew J. Katz , Micha Sharir

Strong blocking sets and their counterparts, minimal codes, attracted lots of attention in the last years. Combining the concatenating construction of codes with a geometric insight into the minimality condition, we explicitly provide…

Combinatorics · Mathematics 2023-01-24 Daniele Bartoli , Martino Borello

Let $\mathcal G$ be a family of subsets of an $n$-element set. The family $\mathcal G$ is called $3$-wise $t$-intersecting if the intersection of any three subsets in $\mathcal G$ is of size at least $t$. For a real number $p\in(0,1)$ we…

Combinatorics · Mathematics 2023-03-03 Norihide Tokushige

The Johnson graph $J(n, i)$ is defined as the graph whose vertex set is the set of all $i$-element subsets of $\{1, . . ., n \}$, and two vertices are adjacent whenever the cardinality of their intersection is equal to $i$-1. In Ramras and…

Combinatorics · Mathematics 2017-10-17 S. Morteza Mirafzal

The intersection of two Steiner triple systems (X,A) and (X,B) is the set A intersect B. The fine intersection problem for Steiner triple systems is to determine for each v, the set I(v), consisting of all possible pairs (m,n) such that…

Combinatorics · Mathematics 2008-07-17 Yeow Meng Chee , Alan C. H. Ling , Hao Shen

We show that every graph of maximum degree 3 can be represented as the intersection graph of axis parallel boxes in three dimensions, that is, every vertex can be mapped to an axis parallel box such that two boxes intersect if and only if…

Combinatorics · Mathematics 2011-08-30 Abhijin Adiga , L. Sunil Chandran

We are interested in the structure of almost complete intersection ideals of grade 3. We give three constructions of these ideals and their free resolutions: one from the commutative algebra point of view, an equivariant construction giving…

Commutative Algebra · Mathematics 2021-06-29 Lars Winther Christensen , Oana Veliche , Jerzy Weyman

In this paper we are interested in BB knots, namely knots and links where the bridge index equals the braid index. Supported by observations from experiments, it is conjectured that BB knots possess a special geometric/physical property…

Geometric Topology · Mathematics 2021-08-27 Yuanan Diao , Claus Ernst , Philipp Reiter

It is shown that a normalized complex Hadamard matrix of order $6$ having three distinct columns, each containing at least one $-1$ entry necessarily belongs to the transposed Fourier family, or to the family of $2$-circulant complex…

Combinatorics · Mathematics 2024-10-07 Ákos K. Matszangosz , Ferenc Szöllősi

An ordered pair $\hat{S}=(S,S^+)$ of subsets of $V$ is called a {\em biset} if $S \subseteq S^+$; $(V-S^+,V-S)$ is the co-biset of $\hat{S}$. Two bisets $\hat{X},\hat{Y}$ intersect if $X \cap Y \neq \emptyset$ and cross if both $X \cap Y…

Data Structures and Algorithms · Computer Science 2012-07-19 Zeev Nutov

We classify all sets of nonzero vectors in $\mathbb{R}^3$ such that the angle formed by each pair is a rational multiple of $\pi$. The special case of four-element subsets lets us classify all tetrahedra whose dihedral angles are multiples…

Metric Geometry · Mathematics 2020-12-01 Kiran S. Kedlaya , Alexander Kolpakov , Bjorn Poonen , Michael Rubinstein

The minimum dominating set problem asks for a dominating set with minimum size. First, we determine some vertices contained in the minimum dominating set of a graph. By applying a particular scheme, we ensure that the resulting graph is…

Combinatorics · Mathematics 2025-12-15 Misa Nakanishi

We demonstrate an infinite family of pseudoline arrangements, in which an arrangement of n pseudolines has no member incident to more than 4n/9 points of intersection. This shows the "Strong Dirac" conjecture to be false for pseudolines. We…

Combinatorics · Mathematics 2014-01-14 Ben D. Lund , George B. Purdy , Justin W. Smith

The Johnson graph J(n,N) is defined as the graph whose vertices are the n-subsets of the set {1,2,...,N}, where two vertices are adjacent if they share exactly n - 1 elements. Unlike Johnson graphs, induced subgraphs of Johnson graphs (JIS…

Combinatorics · Mathematics 2012-05-23 Ramin Naimi , Jeffrey Shaw

We prove a symmetric version of B\'ezout's theorem. More precisely, we show that the symmetric orbit type of a transverse intersection of complex symmetric hypersurfaces in projective space is determined by the degrees. In the projective…

Algebraic Geometry · Mathematics 2024-10-01 Samuel Lidz , Zachary Lihn , Adam Melrod

Let $G$ be a commutative algebraic group embedded in projective space and $\Gamma$ a finitely generated subgroup of $G$. From these data we construct a chain of algebraic subgroups of $G$ which is intimately related to obstructions to…

Number Theory · Mathematics 2012-09-12 Stéphane Fischler , Michael Nakamaye

Families of alternating knots (links) and tangles are studied using as building block the conway defined as the twisting of two strands. The regular representation of knots assumes the projection has the minimal number of overpassings, and…

General Topology · Mathematics 2012-06-18 E. Piña

We consider a classical N. Steenrod's problem on realization of homology classes by images of the fundamental classes of manifolds. It is well-known that each integral homology class can be realized with some multiplicity as an image of the…

Geometric Topology · Mathematics 2024-11-20 A. A. Gaifullin

A split system $\mathcal S$ on a finite set $X$, $|X|\ge3$, is a set of bipartitions or splits of $X$ which contains all splits of the form $\{x,X-\{x\}\}$, $x \in X$. To any such split system $\mathcal S$ we can associate the Buneman graph…

Combinatorics · Mathematics 2022-11-09 M. Hellmuth , K. T. Huber , V. Moulton , G. E. Scholz , P. F. Stadler