English
Related papers

Related papers: Separations of Matroid Freeness Properties

200 papers

We generalize the well-studied notion of a modular pair of a finite matroid to arbitrary families of sets in infinite matroids, and use it to develop the theory of infinite matroids in several as-yet-unexplored areas. Our results include a…

Combinatorics · Mathematics 2026-04-23 Mattias Ehatamm , Peter Nelson , Fernanda Rivera Omana

In this paper, we define the notion of rigidity for linear electrical multiports and for matroid pairs. We show the parallel between the two and study the consequences of this parallel. We present applications to testing, using purely…

Combinatorics · Mathematics 2021-03-10 H. Narayanan

We introduce an interesting method of proving separable reduction theorems - the method of elementary submodels. We are studying whether it is true that a set (function) has given property if and only if it has this property with respect to…

Functional Analysis · Mathematics 2013-01-08 Marek Cúth

In recent years, various notions of algebraic independence have emerged as a central and unifying theme in a number of areas of applied mathematics, including algebraic statistics and the rigidity theory of bar-and-joint frameworks. In each…

Combinatorics · Mathematics 2019-01-08 Zvi Rosen , Jessica Sidman , Louis Theran

The investigation of width parameters in both graph and algebraic contexts has attracted considerable interest. Among these parameters, the linear branch width has emerged as a crucial measure. In this concise paper, we explore the concept…

Combinatorics · Mathematics 2026-03-03 Takaaki Fujita

Since the topic emerged several years ago, work on regular model checking has mostly been devoted to the verification of state reachability and safety properties. Though it was known that linear temporal properties could also be checked…

Logic in Computer Science · Computer Science 2009-01-27 Ahmed Bouajjani , Axel Legay , Pierre Wolper

We study hidden-variable models from quantum mechanics, and their abstractions in purely probabilistic and relational frameworks, by means of logics of dependence and independence, based on team semantics. We show that common desirable…

Logic in Computer Science · Computer Science 2022-01-28 Rafael Albert , Erich Grädel

It often goes unnoticed that, even for a finite number of degrees of freedom, the canonical commutation relations have many inequivalent irreducible unitary representations; the free particle and a particle in a box provide examples that…

Quantum Physics · Physics 2012-01-25 R. N. Sen

Hyperproperties are properties of systems that relate multiple computation traces, including security and concurrency properties. This paper introduces a bounded model checking (BMC) algorithm for hyperproperties expressed in HyperLTL,…

Formal Languages and Automata Theory · Computer Science 2020-10-19 Tzu-Han Hsu , Cesar Sanchez , Borzoo Bonakdarpour

In this thesis, we study nearly finitary matroids by introducing new definitions and prove various properties of nearly finitary matroids. In 2010, an axiom system for infinite matroids was proposed by Bruhn et al. We use this axiom system…

Combinatorics · Mathematics 2019-06-13 Patrick Tam

In this paper, we consider the problem of testing properties of joint distributions under the Conditional Sampling framework. In the standard sampling model, the sample complexity of testing properties of joint distributions is exponential…

Computational Complexity · Computer Science 2022-08-03 Rishiraj Bhattacharyya , Sourav Chakraborty

Finite matroids are combinatorial structures that express the concept of linear independence. In 1964, G.-C. Rota conjectured that the coefficients of the "characteristic polynomial" of a matroid $M$, polynomial whose coefficients enumerate…

Algebraic Geometry · Mathematics 2023-03-03 Antoine Chambert-Loir

We present an algebraic framework which simultaneously generalizes the notion of linear subspaces, matroids, valuated matroids, and oriented matroids. We call the resulting objects matroids over hyperfields. In fact, there are (at least)…

Combinatorics · Mathematics 2017-04-21 Matthew Baker , Nathan Bowler

Given two testable properties $\mathcal{P}_{1}$ and $\mathcal{P}_{2}$, under what conditions are the union, intersection or set-difference of these two properties also testable? We initiate a systematic study of these basic set-theoretic…

Data Structures and Algorithms · Computer Science 2010-10-26 Victor Chen , Madhu Sudan , Ning Xie

We introduce the notion of the free product of $q$-matroids, which is the $q$-analogue of the free product of matroids. We study the properties of this noncommutative binary operation, making an extensive use of the theory of cyclic flats.…

Combinatorics · Mathematics 2024-12-18 Gianira N. Alfarano , Eimear Byrne , Andrew Fulcher

The study of matroid products traces back to the 1970s, when Lov\'asz and Mason studied the existence of various types of matroid products with different strengths. Among these, the tensor product is arguably the most important, which can…

In this article, we study polymatroids that are representable by means of linear restricted rank-metric codes, namely, by subspaces of the space of alternating, symmetric, or Hermitian square matrices endowed with the rank metric. More…

Combinatorics · Mathematics 2026-02-20 Eimear Byrne , Giovanni Longobardi , and Rocco Trombetti

Matrix functions extend scalar function concepts to linear operators, offering a unified framework with broad applications in mathematics, science, and engineering. Classical definitions--via power series, spectral calculus, or Jordan…

Functional Analysis · Mathematics 2025-10-21 Shih-Yu Chang

We provide a combinatorial study of split matroids, a class that was motivated by the study of matroid polytopes from a tropical geometry point of view. A nice feature of split matroids is that they generalize paving matroids, while being…

Combinatorics · Mathematics 2022-02-10 Kristóf Bérczi , Tamás Király , Tamás Schwarcz , Yutaro Yamaguchi , Yu Yokoi

We introduce the notion of a quasi-matroidal class of ordered simplicial complexes: an approximation to the idea of a matroid cryptomorphism in the landscape of ordered simplicial complexes. A quasi-matroidal class contains pure shifted…

Combinatorics · Mathematics 2016-08-16 Jose Alejandro Samper
‹ Prev 1 3 4 5 6 7 10 Next ›