English
Related papers

Related papers: Pattern Recognition on Oriented Matroids: K*-Vecto…

200 papers

We discuss the problem of theoretical uncertainties in the combination of observables related to the CKM matrix elements and propose a statistically sensible method for combining them. The overall fit is performed on present data, and…

High Energy Physics - Phenomenology · Physics 2007-05-23 S. Plaszczynski , M. H Schune

This paper considers three separate matrices associated to graphs and (each dimension of) cell complexes. It relates all the coefficients of their respective characteristic polynomials to the geometric and combinatorial enumeration of three…

Combinatorics · Mathematics 2016-12-26 Sylvain E. Cappell , Edward Y. Miller

This paper investigates the question of uniqueness of the reduced oriented matroid structure arising from root systems of a Coxeter group in real vector spaces. We settle the question for finite Coxeter groups, irreducible affine Weyl…

Representation Theory · Mathematics 2017-10-12 Matthew Dyer , Weijia Wang

We introduce and study matrix transfers to achieve elementary models for bivariant $K$-theory. They share lots of common properties with Voevodsky's framed correspondences and lead to symmetric matrix motives of algebraic varieties…

K-Theory and Homology · Mathematics 2025-04-09 Grigory Garkusha

Let $M$ be a matroid defined on a finite set $E$ and $L\subset E$. $L$ is locked in $M$ if $M|L$ and $M^*|(E\backslash L)$ are 2-connected, and $min\{r(L), r^*(E\backslash L)\} \geq 2$. Locked subsets characterize nontrivial facets of the…

Computational Complexity · Computer Science 2019-06-20 Brahim Chaourar

A matroid complex is a pure complex such that every restriction is again pure. It is a long-standing open problem to classify all possible $h$-vectors of such complexes. In the case when the complex has dimension 1 we completely resolve…

Commutative Algebra · Mathematics 2009-03-23 Erik Stokes

Matrix transposition induces an involution on the isomorphism classes of semi-simple n-dimensional representations of the three string braid group. We show that a connected component of this variety can detect braid-reversion or that the…

Rings and Algebras · Mathematics 2011-02-22 Lieven Le Bruyn

The separation theorem of Kirchberger can be proven using a combination of Farkas' Lemma and Caratheodory's Theorem. Since those theorems are at the heart of oriented matroids, we are interested in a generalization of Kirchberger's Theorem…

Combinatorics · Mathematics 2022-07-29 Winfried Hochstättler , Sophia Keip , Kolja Knauer

The Topological Representation Theorem for (oriented) matroids states that every (oriented) matroid can be realized as the intersection lattice of an arrangement of codimension one homotopy spheres on a homotopy sphere. In this paper, we…

Combinatorics · Mathematics 2015-03-19 Matthew T. Stamps

Matroids and semigraphoids are discrete structures abstracting and generalizing linear independence among vectors and conditional independence among random variables, respectively. Despite the different nature of conditional independence…

Combinatorics · Mathematics 2023-03-14 Xiangying Chen

In this paper, we develop twisted $K$-theory for stacks, where the twisted class is given by an $S^1$-gerbe over the stack. General properties, including the Mayer-Vietoris property, Bott periodicity, and the product structure $K^i_\alpha…

K-Theory and Homology · Mathematics 2007-05-23 Jean-Louis Tu , Ping Xu , Camille Laurent-Gengoux

Important objects of study in $\tau$-tilting theory include the $\tau$-tilting pairs over an algebra on the form $kQ/I$, with $kQ$ being a path algebra and $I$ an admissible ideal. In this paper, we study aspects of the combinatorics of…

Representation Theory · Mathematics 2021-09-27 Håvard Utne Terland

Boundary conditions compatible with integrability are obtained for two dimensional models by solving the factorizability equations for the reflection matrices $K^{\pm}(\theta)$. For the six vertex model the general solution depending on…

High Energy Physics - Theory · Physics 2009-10-22 H. J. de Vega , A. González Ruiz

It is well known that the class of transversal matroids is not closed under contraction or duality. In particular, after contracting a set of elements from a transversal matroid, the resulting matroid may or may not be transversal, and the…

Combinatorics · Mathematics 2024-09-24 Samuel Bastida

We give a criterion for H-convergence of conductivity matrices in terms of ordinary weak convergence of the factors in certain quotient representations of the matrices.

Analysis of PDEs · Mathematics 2007-05-23 Björn Gustafsson , Jacqueline Mossino

Oriented matroids (often called order types) are combinatorial structures that generalize point configurations, vector configurations, hyperplane arrangements, polyhedra, linear programs, and directed graphs. Oriented matroids have played a…

Combinatorics · Mathematics 2020-06-17 Ilan Adler , Jesús A. De Loera , Steven Klee , Zhenyang Zhang

Motivated by Gr\"obner basis theory for finite point configurations, we define and study the class of "standard complexes" associated to a matroid. Standard complexes are certain subcomplexes of the independence complex that are invariant…

Combinatorics · Mathematics 2019-11-28 Alexander Engström , Raman Sanyal , Christian Stump

Let $A$ be a separable, unital and exact $C^*$-algebra satisfying the universal coefficient theorem. We prove uniqueness theorems up to unitary conjugacy for unital, full and nuclear maps from $A$ into ultraproducts of finite von Neumann…

Operator Algebras · Mathematics 2026-05-15 Shanshan Hua , Stuart White

We consider decompositions of topes of the oriented matroid realizable as the arrangement of coordinate hyperplanes in $\mathbb{R}^{2^t}$, with respect to a distinguished symmetric $2\cdot 2^t$-cycle in its hypercube graph of topes…

Combinatorics · Mathematics 2021-08-04 Andrey O. Matveev

Seymour's decomposition theorem for regular matroids is a fundamental result with a number of combinatorial and algorithmic applications. In this work we demonstrate how this theorem can be used in the design of parameterized algorithms on…

Data Structures and Algorithms · Computer Science 2017-10-09 Fedor V. Fomin , Petr A. Golovach , Daniel Lokshtanov , Saket Saurabh