English
Related papers

Related papers: Uniform semimodular lattices and valuated matroids

200 papers

We introduce an idempotent analogue of the exterior algebra for which the theory of tropical linear spaces (and valuated matroids) can be seen in close analogy with the classical Grassmann algebra formalism for linear spaces. The top wedge…

Algebraic Geometry · Mathematics 2017-09-15 Jeffrey Giansiracusa , Noah Giansiracusa

A periodic lattice in Euclidean 3-space is the infinite set of all integer linear combinations of basis vectors. Any lattice can be generated by infinitely many different bases. This ambiguity was only partially resolved, but standard…

Metric Geometry · Mathematics 2022-01-26 Vitaliy Kurlin

The purpose of this paper is to establish analogues of the classical Lefschetz Section Theorem for smooth tropical varieties. More precisely, we prove tropical analogues of the section theorems of Lefschetz, Andreotti-Frankel,…

Algebraic Geometry · Mathematics 2021-01-26 Karim Alexander Adiprasito , Anders Björner

In this paper, first steps are taken towards characterising lattices of cyclic flats $\mathcal{Z}(M)$ that belong to matroids $M$ that can be represented over a prescribed finite field $\mathbb{F}_q$. Two natural maps from $\mathcal{Z}(M)$…

Combinatorics · Mathematics 2019-06-27 Ragnar Freij-Hollanti , Matthias Grezet , Camilla Hollanti , Thomas Westerbäck

We introduce semidistrim lattices, a simultaneous generalization of semidistributive and trim lattices that preserves many of their common properties. We prove that the elements of a semidistrim lattice correspond to the independent sets in…

Combinatorics · Mathematics 2021-11-17 Colin Defant , Nathan Williams

In previous work we proved that, for categories of free finite-dimensional modules over a commutative semiring, linear compact-closed symmetric monoidal structure is a property, rather than a structure. That is, if there is such a…

Quantum Physics · Physics 2019-01-30 Stefano Gogioso , Dan Marsden , Bob Coecke

This article studies two notions of generalized matroid representations motivated by algorithmic information theory and cryptographic secret sharing. The first (entropic representability) involves discrete random variables, while the second…

Combinatorics · Mathematics 2026-05-28 Lukas Kühne , Geva Yashfe

For a finite lattice $\Lambda$, $\Lambda$-ultrametric spaces have, among other reasons, appeared as a means of constructing structures with lattices of equivalence relations embedding $\Lambda$. This makes use of an isomorphism of…

Rings and Algebras · Mathematics 2020-02-26 Samuel Braunfeld

We identify a class of symmetric algebras over a complete discrete valuation ring $\mathcal O$ of characteristic zero to which the characterisation of Kn\"orr lattices in terms of stable endomorphism rings in the case of finite group…

Representation Theory · Mathematics 2018-03-16 Florian Eisele , Michael Geline , Radha Kessar , Markus Linckelmann

An affine variety induces the structure of an algebraic matroid on the set of coordinates of the ambient space. The matroid has two natural decorations: a circuit polynomial attached to each circuit, and the degree of the projection map to…

Combinatorics · Mathematics 2014-04-09 Zvi Rosen

This paper is a direct generalization of Baker-Bowler theory to flag matroids, including its moduli interpretation as developed by Baker and the second author for matroids. More explicitly, we extend the notion of flag matroids to flag…

Combinatorics · Mathematics 2024-01-17 Manoel Jarra , Oliver Lorscheid

This paper reveals a categorical equivalence connecting two distinct quantum logic structures. The first is the orthomodular lattice, an algebraic system designed to formalize the properties of quantum systems. The second is a finitary…

Logic · Mathematics 2026-04-21 Juanda Kelana Putra , Richard Smolka

We introduce a procedure that solves the decision problem whether a given matroid M is a gammoid. The procedure consists of three pieces: First, we introduce a notion of a valid matroid tableau which captures the current state of knowledge…

Combinatorics · Mathematics 2018-07-03 Immanuel Albrecht

The general construction of lattice (co)homology assigns to a lattice $\mathbb{Z}^r$ and a weight function $w:\mathbb{Z}^r \to \mathbb{Z}$ a bigraded $\mathbb{Z}[U]$-module $\mathbb{H}_*$. The weight function $w$ is often obtained from some…

Algebraic Geometry · Mathematics 2026-03-30 András Némethi , Gergő Schefler

The basic distinction between already known algorithmic characterizations of matroids and antimatroids is in the fact that for antimatroids the ordering of elements is of great importance. While antimatroids can also be characterized as set…

Combinatorics · Mathematics 2007-05-23 Yulia Kempner , Vadim E. Levit

An ordered semiring is a commutative semiring equipped with a compatible preorder. Ordered semirings generalise both distributive lattices and commutative rings, and provide a convenient framework to unify certain aspects of lattice theory…

Category Theory · Mathematics 2023-11-08 Soichiro Fujii

We consider all compatible topologies of an arbitrary finite-dimensional vector space over a non-trivial valuation field whose metric completion is a locally compact space. We construct the canonical lattice isomorphism between the lattice…

General Topology · Mathematics 2023-12-01 Takanobu Aoyama

\emph{Proto-exact categories}, introduced by Dyckerhoff and Kapranov, are a generalization of Quillen exact categories which provide a framework for defining algebraic K-theory and Hall algebras in a \emph{non-additive} setting. This…

Category Theory · Mathematics 2022-02-04 Jaiung Jun , Matt Szczesny , Jeffrey Tolliver

A collection of vectors in a real vector space is called a unimodular system if any of its maximal linearly independent subsets generates the same free abelian group. This notion is closely connected with totally unimodular matrices: rows…

Combinatorics · Mathematics 2023-10-16 I. V. Artamkin

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
‹ Prev 1 4 5 6 7 8 10 Next ›