English
Related papers

Related papers: Pattern Recognition on Oriented Matroids: Three-To…

200 papers

Leclerc and Zelevinsky, motivated by the study of quasi-commuting quantum flag minors, introduced the notions of strongly separated and weakly separated collections. These notions are closely related to the theory of cluster algebras, to…

Combinatorics · Mathematics 2021-03-26 Pavel Galashin , Alexander Postnikov

Let V be a finite set and M a collection of subsets of V. Then M is an alignment of V if and only if M is closed under taking intersections and contains both V and the empty set. If M is an alignment of V, then the elements of M are called…

Combinatorics · Mathematics 2011-07-07 J. Cáceres , O. R. Oellermann , M. L. Puertas

We characterize which systems of sign vectors are the cocircuits of an oriented matroid in terms of the cocircuit graph.

Combinatorics · Mathematics 2011-06-07 Kolja Knauer , Juan Jose Montellano-Ballesteros , Ricardo Strausz

Matrices are the most common representations of graphs. They are also used for the representation of algebras and cluster algebras. This paper shows some properties of matrices in order to facilitate the understanding and locating…

Discrete Mathematics · Computer Science 2015-03-12 Elisângela Silva Dias , Diane Castonguay , Mitre Costa Dourado

For a discrete poset $\mathcal X$ McCord proved that the natural map $|{\mathcal X}|\to {\mathcal X}$ from the order complex to the poset equipped with the Up topology is a weak homotopy equivalence. Much later, Zivaljevi\'{c} defined the…

Combinatorics · Mathematics 2024-05-30 Ulysses Alvarez , Ross Geoghegan

One method for obtaining every closed orientable 3-manifold is as branched covering of the 3-sphere over a link. There is a classical topological result showing that the minimun possible number of sheets in the covering is three. In this…

Geometric Topology · Mathematics 2007-10-11 G. Brumfiel , H. Hilden , M. T. Lozano , J. M. Montesinos--Amilibia , E. Ramirez--Losada , H. Short , D. Tejada , M. Toro

We analyze polyhedra composed of hexagons and triangles with three faces around each vertex, and their 3-regular planar graphs of edges and vertices, which we call "trihexes". Trihexes are analogous to fullerenes, which are 3-regular planar…

Combinatorics · Mathematics 2025-07-01 Linda Green , Stellen Li

The classical Whitney's 2-Isomorphism Theorem describes the families of graphs having the same cycle matroid. In this paper we describe the families of graphs having the same truncated cycle matroid and prove, in particular, that every…

Combinatorics · Mathematics 2022-10-03 Jose De Jesus , Alexander Kelmans

We introduce the minor-closed, dual-closed class of multi-path matroids. We give a polynomial-time algorithm for computing the Tutte polynomial of a multi-path matroid, we describe their basis activities, and we prove some basic structural…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin , Omer Gimenez

We interpret the ranks of the rational homotopy groups of a K3 surface as dimensions of representations for the largest sporadic simple Mathieu group. We then construct a vertex algebra equipped with an action by the largest Mathieu group,…

Representation Theory · Mathematics 2025-09-24 Federico Carta , John F. R. Duncan , Yang-Hui He

The aim of this paper is to study alcoved polytopes, which are polytopes arising from affine Coxeter arrangements. This class of convex polytopes includes many classical polytopes, for example, the hypersimplices. We compare two…

Combinatorics · Mathematics 2007-05-23 Thomas Lam , Alexander Postnikov

For each $n\leq 6$, we characterize all the groups which can occur as either the orientation preserving topological symmetry group or the topological symmetry group of some embedding of $K_n$ in $S^3$.

Geometric Topology · Mathematics 2014-02-17 Dwayne Chambers , Erica Flapan

A transversal matroid whose dual is also transversal is called bi-transversal. Let $G$ be an undirected graph with vertex set $V$. In this paper, for every subset $W$ of $V$, we associate a bi-transversal matroid to the pair $(G,W)$. We…

Combinatorics · Mathematics 2024-03-01 Mahdi Ebrahimi

If $G$ is a looped graph, then its adjacency matrix represents a binary matroid $M_{A}(G)$ on $V(G)$. $M_{A}(G)$ may be obtained from the delta-matroid represented by the adjacency matrix of $G$, but $M_{A}(G)$ is less sensitive to the…

Combinatorics · Mathematics 2013-09-04 Robert Brijder , Hendrik Jan Hoogeboom , Lorenzo Traldi

There are two properties shared by all known crossing-minimizing geometric drawings of $K_n$, for $n$ a multiple of 3. First, the underlying $n$-point set of these drawings has exactly $3\binom{k+2}{2}$ $(\le k)$-edges, for all $0\le k <…

Combinatorics · Mathematics 2019-04-29 M. Cetina , C. Hernández-Vélez , J. Leaños , C. Villalobos

An {\sf oriented perfect path double cover} ($\rm OPPDC$) of a graph $G$ is a collection of directed paths in the symmetric orientation $G_s$ of $G$ such that each edge of $G_s$ lies in exactly one of the paths and each vertex of $G$…

Combinatorics · Mathematics 2012-07-10 Behrooz Bagheri Gh. , Behnaz Omoomi

The notion of "antimatroid with repetition" was conceived by Bjorner, Lovasz and Shor in 1991 as a multiset extension of the notion of antimatroid. When the underlying set consists of only two elements, such two-dimensional antimatroids…

Combinatorics · Mathematics 2011-01-25 Yulia Kempner , Vadim E. Levit

One of the main challenges in 3d-3d correspondence is that no existent approach offers a complete description of 3d $N=2$ SCFT $T[M_3]$ --- or, rather, a "collection of SCFTs" as we refer to it in the paper --- for all types of 3-manifolds…

High Energy Physics - Theory · Physics 2020-09-29 Sungbong Chun , Sergei Gukov , Sunghyuk Park , Nikita Sopenko

Rota's basis conjecture, open since 1989, states that if B_1, B_2, ..., B_n are n bases of a vector space of rank n, then there is an nxn grid of vectors such that the vectors in the ith row are precisely the elements of B_i and such that…

Combinatorics · Mathematics 2008-09-09 Timothy Y. Chow

We prove several results about matroids and matroidal families associated with rigidity in dimension $2$. In particular, we establish new properties of the generic rigidity matroid family $\mathcal{R}$ and Kalai's hyperconnectivity matroid…

Combinatorics · Mathematics 2026-02-13 Mykhaylo Tyomkyn
‹ Prev 1 8 9 10 Next ›