English
Related papers

Related papers: Tensor Product of Polymatroids and Common Informat…

200 papers

This article is a survey of matroid theory aimed at algebraic geometers. Matroids are combinatorial abstractions of linear subspaces and hyperplane arrangements. Not all matroids come from linear subspaces; those that do are said to be…

Algebraic Geometry · Mathematics 2014-09-12 Eric Katz

We show that if the ground set of a matroid can be partitioned into $k\ge 2$ bases, then for any given subset $S$ of the ground set, there is a partition into $k$ bases such that the sizes of the intersections of the bases with $S$ may…

Combinatorics · Mathematics 2025-12-02 Hannaneh Akrami , Siyue Liu , Roshan Raj , László A. Végh

We introduce ideas that complement the many known connections between polymatroids and graph coloring. Given a hypergraph that satisfies certain conditions, we construct polymatroids, given as rank functions, that can be written as sums of…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin , Carolyn Chun

This paper is concerned with the prime spectrum of a tensor product of algebras over a field. It seeks necessary and sufficient conditions for such a tensor product to have the S-property, strong S-property, and catenarity. Its main results…

Commutative Algebra · Mathematics 2007-05-23 S. Bouchiba , D. E. Dobbs , S. Kabbaj

We prove that if M is a vertically 4-connected matroid with a modular flat X of rank at least three, then every representation of M | X over a finite field F extends to a unique F-representation of M. A corollary is that when F has order q,…

Combinatorics · Mathematics 2013-04-25 Jim Geelen , Rohan Kapadia

Melchior's inequality implies that the average line-length in a simple, rank-$3$, real-representable matroid is less than $3$. A similar result holds for complex-representable matroids, using Hirzebruch's inequality, but with a weaker bound…

Combinatorics · Mathematics 2024-03-05 Rutger Campbell , Jim Geelen , Matthew E. Kroeker

Let $R$ be a ring and let $n\ge 2$. We discuss the question of whether every element in the matrix ring $M_n(R)$ is a product of (additive) commutators $[x,y]=xy-yx$, for $x,y\in M_n(R)$. An example showing that this does not always hold,…

Rings and Algebras · Mathematics 2024-04-30 Matej Brešar , Eusebio Gardella , Hannes Thiel

Asymptotic tensor rank is notoriously difficult to determine. Indeed, determining its value for the $2\times 2$ matrix multiplication tensor would determine the matrix multiplication exponent, a long-standing open problem. On the other…

Computational Complexity · Computer Science 2024-11-26 Matthias Christandl , Koen Hoeberechts , Harold Nieuwboer , Péter Vrana , Jeroen Zuiddam

An access structure is said to be multipartite, if the set of participants is divided into several parts and all participants in the same part play an equivalent role. The search for ideal secret sharing schemes for some special interesting…

Cryptography and Security · Computer Science 2021-07-26 Renata Kawa , Mieczyslaw Kula

This is a continuation of the early paper concerning matroid base polytope decomposition. Here, we will present sufficient conditions on $M$ so its base matroid polytope $P(M)$ has a {\em sequence} of hyperplane splits. The latter yields to…

Combinatorics · Mathematics 2013-11-28 Vanessa Chatelain , Jorge Ramirez Alfonsin

We show that two tensor permutation matrices permutate tensor product of rectangle matrices. Some examples, in the particular case of tensor commutation matrices, for studying some linear matrix equations are given.

General Mathematics · Mathematics 2013-06-19 Christian Rakotonirina

The problem of whether the cohomological support map of a finite dimensional Hopf algebra has the tensor product property has attracted a lot of attention following the earlier developments on representations of finite group schemes. Many…

Category Theory · Mathematics 2021-08-12 Daniel K. Nakano , Kent B. Vashaw , Milen T. Yakimov

We give a general multiplication-convolution identity for the multivariate and bivariate rank generating polynomial of a matroid. The bivariate rank generating polynomial is transformable to and from the Tutte polynomial by simple algebraic…

Combinatorics · Mathematics 2009-09-15 Joseph P. S. Kung

White's conjecture asserts that any two tuples of matroid bases that have the same multi-set union can be transformed from one to another by symmetric exchanges; it also implies that the toric ideals of matroids are generated by the…

Combinatorics · Mathematics 2025-10-07 Yu-Chuan Yu , Chi Ho Yuen

We prove a general duality theorem for tangle-like dense objects in combinatorial structures such as graphs and matroids. This paper continues, and assumes familiarity with, the theory developed in [6]

Combinatorics · Mathematics 2014-06-17 Reinhard Diestel , Sang-il Oum

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

Thin sums matroids were introduced to extend the notion of representability to non-finitary matroids. We give a new criterion for testing when the thin sums construction gives a matroid. We show that thin sums matroids over thin families…

Combinatorics · Mathematics 2012-04-30 Hadi Afzali , Nathan Bowler

Given a $4$-dimensional vector subspace $U=\{ f_{0},\ldots,f_{3}\}$ of $H^{0}(\mathbb{P}^1 \times \mathbb{P}^1,\mathcal{O}(a,b))$, a tensor product surface, denoted by $X_{U}$, is the closure of the image of the rational map…

Commutative Algebra · Mathematics 2016-10-13 Eliana Duarte

It is known that a linear system with a system matrix A constitutes a Hamiltonian system with a quadratic Hamiltonian if and only if A is a Hamiltonian matrix. This provides a straightforward method to verify whether a linear system is…

Systems and Control · Electrical Eng. & Systems 2025-03-28 Shaoxuan Cui , Guofeng Zhang , Hildeberto Jardon-Kojakhmetov , Ming Cao

This paper contributes to the study of rank-metric codes from an algebraic and combinatorial point of view. We introduce $q$-polymatroids, the $q$-analogue of polymatroids, and develop their basic properties. We associate a pair of…

Information Theory · Computer Science 2019-09-06 Elisa Gorla , Relinde Jurrius , Hiram H. López , Alberto Ravagnani
‹ Prev 1 3 4 5 6 7 10 Next ›