English
Related papers

Related papers: Connectivity of single-element coextensions of a b…

200 papers

Given $n$ pairwise disjoint sets $X_1,\ldots, X_n$, we call the elements of $S=X_1\times\ldots\times X_n$ strings. A nonempty set of strings $W\subseteq S$ is said to be well-connected if for every $v\in W$ and for every $i\, (1\le i\le…

Combinatorics · Mathematics 2021-12-22 Peter Frankl , Janos Pach

Let AG(3,2)xU(1,1) denote the binary matroid obtained from the direct sum of AG(3,2) and a coloop by completing the 3-point lines between every element in AG(3,2) and the coloop. We prove that every internally 4-connected binary matroid…

Combinatorics · Mathematics 2012-02-20 Dillon Mayhew , Gordon Royle

We study monoidal 2-categories and bicategories in terms of categorical extensions and the cohomological data they determine in appropriate cohomology theories with coefficients in Picard groupoids. In particular, we analyze the hierarchy…

Category Theory · Mathematics 2024-11-19 Ettore Aldrovandi , Milind Gunjal

A simple binary matroid is called claw-free if none of its rank-3 flats are independent sets. These objects can be equivalently defined as the sets $E$ of points in $\mathrm{PG}(n-1,2)$ for which $|E \cap P|$ is not a basis of $P$ for any…

Combinatorics · Mathematics 2018-08-01 Peter Nelson , Kazuhiro Nomoto

We address the question of when a covering of the boundary of a surface can be extended to a covering of the surface (equivalently: when is there a branched cover with a prescribed monodromy). If such an extension is possible, when can the…

Geometric Topology · Mathematics 2014-02-26 Manfred Droste , Igor Rivin

A simple binary matroid is called $I_4$-free if none of its rank-4 flats are independent sets. These objects can be equivalently defined as the sets $E$ of points in $PG(n-1,2)$ for which $|E \cap F|$ is not a basis of $F$ for any…

Combinatorics · Mathematics 2020-05-04 Peter Nelson , Kazuhiro Nomoto

We use the Strong Splitter Theorem to decompose the excluded minor class of binary matroids with no $E_4$-minor. Using this theorem we can get the 3-decomposers and the extremal internally 4-connected matroids as well as any other important…

Combinatorics · Mathematics 2014-08-12 S. R. Kingan

The family of 2-level matroids, that is, matroids whose base polytope is 2-level, has been recently studied and characterized by means of combinatorial properties. 2-level matroids generalize series-parallel graphs, which have been already…

Combinatorics · Mathematics 2015-10-15 Francesco Grande , Juanjo Rué

Necessary and sufficient conditions for a sequence of positive integers to be the degree sequence of a k-connected simple graph are detailed. Conditions are also given under which such a sequence is necessarily k-connected.

Combinatorics · Mathematics 2015-12-19 Jonathan McLaughlin

The purpose of this paper is to prove a generalization of Faltings' connectedness theorem which asserts that, for a complete local domain R of dimension n, the punctured spectrum of R/I is connected if the ideal I is generated by at most…

Commutative Algebra · Mathematics 2007-05-23 Melvin Hochster , Craig Huneke

A class A of labelled graphs is bridge-addable if for all graphs G in A and all vertices u and v in distinct connected components of G, the graph obtained by adding an edge between u and u is also in A; the class A is monotone if for all G…

Combinatorics · Mathematics 2011-10-04 Louigi Addario Berry , Colin McDiarmid , Bruce Reed

We provide a diagrammatic criterion for semi-adequate links to be hyperbolic. We also give a conjectural description of the satellite structures of semi-adequate links. One application of our result is that the closures of sufficiently…

Geometric Topology · Mathematics 2016-02-12 David Futer , Efstratia Kalfagianni , Jessica S. Purcell

Let ${\mathscr P}$ be a topological property. We say that a space $X$ is ${\mathscr P}$-connected if there exists no pair $C$ and $D$ of disjoint cozero-sets of $X$ with non-${\mathscr P}$ closure such that the remainder $X\backslash(C\cup…

General Topology · Mathematics 2015-06-26 M. R. Koushesh

Let $G$ be a graph such that, whenever two vertices $x$ and $y$ of $G$ are joined by three internally disjoint paths, $x$ and $y$ are adjacent. Jamison and Mulder determined that the set of such graphs coincides with the set of graphs that…

Combinatorics · Mathematics 2023-06-14 Cameron Crenshaw , James Oxley

A matroid M is unbreakable if it is connected and M/F is connected for every flat F of M . Oxley and Pfeil characterized the unbreakable graphic matroids, and Fife, Mayhew, Oxley, and Semple characterized the graphs underlying 3-connected…

Combinatorics · Mathematics 2026-05-14 Sayantani Bhattacharya , John David Clifton , Zach Walsh

Traditionally, knot theorists have considered projections of knots where there are two strands meeting at every crossing. A multi-crossing is a crossing where more than two strands meet at a single point, such that each strand bisects the…

Geometric Topology · Mathematics 2018-05-14 Daishiro Nishida

One proves that there exists an obstruction to an open simply connected $n$-manifold of dimension $n\geq 5$ being geometrically simply connected. In particular there exist uncountably many simply connected $n$-manifolds which are not…

Geometric Topology · Mathematics 2007-05-23 Louis Funar , Siddhartha Gadgil

Let $S$ be an additively idempotent semiring and $\mathbf{M}_n(S)$ be the semiring of all $n\times n$ matrices over $S$. We characterize the conditions of when the semiring $\mathbf{M}_n(S)$ is congruence-simple provided that the semiring…

Rings and Algebras · Mathematics 2023-05-02 Tomáš Kepka , Miroslav Korbelář

We give two sufficient and necessary conditions for a Hochschild extension of a finite dimensional algebra by its dual bimodule and a Hochschild 2-cocycle to be a symmetric algebra.

Rings and Algebras · Mathematics 2021-04-29 Yang Han

We prove that for a general $N$-component model on a $d$-dimensional lattice $\bZ^d$ with pairwise nearest-neighbor coupling and general local interaction obeying a stability bound the linked cluster expansion has a finite radius of…

High Energy Physics - Lattice · Physics 2007-05-23 A. Pordt