English
Related papers

Related papers: Representability of orthogonal matroids over parti…

200 papers

Let $\mathcal{M}$ be a von Neumann algebra with a normal semifinite faithful trace $\tau$. We prove that every continuous $m$-homogeneous polynomial $P$ from $L^p(\mathcal{M},\tau)$, with $0<p<\infty$, into each topological linear space $X$…

Operator Algebras · Mathematics 2019-03-26 J. Alaminos , M. L. C. Godoy , A. R. Villena

Let $\K$ be a finite extension of a characteristic zero field $\F$. We say that the pair of $n\times n$ matrices $(A,B)$ over $\F$ represents $\K$ if $\K \cong \F[A]/< B >$ where $\F[A]$ denotes the smallest subalgebra of $M_n(\F)$…

Number Theory · Mathematics 2012-03-07 A. Satyanarayana Reddy , Shashank K Mehta , A. K. Lal

We show that each algebraic representation of a matroid $M$ in positive characteristic determines a matroid valuation of $M$, which we have named the {\em Lindstr\"om valuation}. If this valuation is trivial, then a linear representation of…

Combinatorics · Mathematics 2017-11-23 Guus Bollen , Jan Draisma , Rudi Pendavingh

We prove that every infinite sequence of skew-symmetric or symmetric matrices M_1, M_2, ... over a fixed finite field must have a pair M_i, M_j (i<j) such that M_i is isomorphic to a principal submatrix of the Schur complement of a…

Combinatorics · Mathematics 2014-03-26 Sang-il Oum

We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in $\Sigma_2^p$. In the case of linear matroids, which are represented over polynomially growing fields, we note that the problem is…

Computational Complexity · Computer Science 2008-11-25 Raghavendra Rao B. V. , Jayalal M. N. Sarma

In a 2014 paper, R.E. Curto and S. Yoo proved that a moment matrix $M(3)$ with specific harmonic polynomials as column relations admits a representing measure if and only if a condition at the level of moments holds. \ In this paper, we…

Functional Analysis · Mathematics 2026-02-24 Raúl E. Curto , Marc R. Moore

We enrich Baker and Bowler's theory of matroids over tracts with notions of vectors and covectors. In the case of oriented matroids, these $F$-vectors and $F$-covectors coincide with the usual signed vectors and signed covectors. In the…

Combinatorics · Mathematics 2018-07-24 Laura Anderson

A matroid $\mathcal{M}$ on a set $E$ of elements has the $\alpha$-partition property, for some $\alpha>0$, if it is possible to (randomly) construct a partition matroid $\mathcal{P}$ on (a subset of) elements of $\mathcal{M}$ such that…

Data Structures and Algorithms · Computer Science 2021-11-25 Dorna Abdolazimi , Anna R. Karlin , Nathan Klein , Shayan Oveis Gharan

A phased matroid is a matroid with additional structure which plays the same role for complex vector arrangements that oriented matroids play for real vector arrangements. The realization space of an oriented (resp., phased) matroid is the…

Combinatorics · Mathematics 2018-07-20 Amanda Ruiz

We study smoothness of realization spaces of matroids for small rank and ground set. For $\mathbb{C}$-realizable matroids, when the rank is $3$, we prove that the realization spaces are all smooth when the ground set has $11$ or fewer…

Algebraic Geometry · Mathematics 2025-03-17 Daniel Corey , Dante Luber

Let $k$ be a perfect field of characteristic $p > 2$, and let $K$ be a finite totally ramified extension over $W(k)[\frac{1}{p}]$. Let $R_0$ be an unramified relative base ring over $W(k)\langle X_1^{\pm 1}, \ldots, X_d^{\pm 1}\rangle$, and…

Number Theory · Mathematics 2018-10-16 Yong Suk Moon

We show that all local martingales with respect to the initially enlarged natural filtration of a vector of multivariate point processes can be weakly represented up to the minimum among the explosion times of the components. We also prove…

Probability · Mathematics 2021-07-12 Antonella Calzolari , Barbara Torti

Let O be a complete discrete valuation domain with finite residue field. In this paper we describe the irreducible representations of the groups Aut(M) for any finite O-module M of rank two. The main emphasis is on the interaction between…

Representation Theory · Mathematics 2008-08-21 Uri Onn

It has been conjectured that asymptotically almost all matroids are sparse paving, i.e. that $s(n) \sim m(n)$, where $m(n)$ denotes the number of matroids on a fixed groundset of size $n$, and $s(n)$ the number of sparse paving matroids. In…

Combinatorics · Mathematics 2016-01-26 Rudi Pendavingh , Jorn van der Pol

Let $R$ be a finite commutative ring with unity $1_R$ and $k \in R$. Properties of one-sided $k$-orthogonal $n \times n$ matrices over $R$ are presented. When $k$ is idempotent, these matrices form a semigroup structure. Consequently new…

Information Theory · Computer Science 2021-03-11 Virgilio P. Sison , Charles R. Repizo

For a matroid of rank $r$ and a non-negative integer $k$, an element is called $k$-loose if every circuit containing it has size greater than $r-k$. Zaslavsky and the author characterized all binary matroids with a $1$-loose element. In…

Combinatorics · Mathematics 2025-03-17 Jagdeep Singh

Let $\beta\equiv\beta^{(2n)}$ be an N-dimensional real multi-sequence of degree 2n, with associated moment matrix $\mathcal{M}(n)\equiv \mathcal{M}(n)(\beta)$, and let $r:=rank \mathcal{M}(n)$. We prove that if $\mathcal{M}(n)$ is positive…

Functional Analysis · Mathematics 2007-05-23 Raul E. Curto , Lawrence A. Fialkow

Efficient deterministic algorithms to construct representations of lattice path matroids over finite fields are presented. They are built on known constructions of hierarchical secret sharing schemes, a recent characterization of…

Combinatorics · Mathematics 2024-07-09 Carles Padró

It is proven that, contrarily to the common belief, the notion of zero is not necessary for having positional representations of numbers. Namely, for any positive integer $k$, a positional representation with the symbols for $1, 2, \ldots,…

History and Overview · Mathematics 2015-05-05 Vincenzo Manca

The present note is a strengthening of a recent paper by K. Takazawa and Y. Yokoi (A generalized-polymatroid approach to disjoint common independent sets in two matroids, Discrete Mathematics (2019)). For given two matroids on $E$, under…

Combinatorics · Mathematics 2019-10-01 Satoru Fujishige , Kenjiro Takazawa , Yu Yokoi
‹ Prev 1 8 9 10 Next ›