English
Related papers

Related papers: Representability of orthogonal matroids over parti…

200 papers

This paper compares skew-linear and multilinear matroid representations. These are matroids that are representable over division rings and (roughly speaking) invertible matrices, respectively. The main tool is the von Staudt construction,…

Combinatorics · Mathematics 2025-05-21 Lukas Kühne , Rudi Pendavingh , Geva Yashfe

In this article, we consider the representation of $m$-gonal forms over $\mathbb N_0$. We show that any $m$-gonal forms over $\mathbb N_0$ of rank $\ge 5$ is almost regular and ponder the sufficiently large integers which are indeed…

Number Theory · Mathematics 2021-10-06 Dayoon Park

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 each positive integer $t$ and each sufficiently large integer $r$, we show that the maximum number of elements of a simple, rank-$r$, $\mathbb C$-representable matroid with no $U_{2,t+3}$-minor is $t{r\choose 2}+r$. We derive this as a…

Combinatorics · Mathematics 2025-02-13 Jim Geelen , Peter Nelson , Zach Walsh

One of the most intriguing unsolved questions of matroid optimization is the characterization of the existence of $k$ disjoint common bases of two matroids. The significance of the problem is well-illustrated by the long list of conjectures…

Combinatorics · Mathematics 2020-02-19 Kristóf Bérczi , Tamás Schwarcz

We show in this article how orthogonal polynomials appear in certain representations of grid shaped quivers. After a short introduction into the general notion of quivers and their representations by linear operators we define the notion of…

Classical Analysis and ODEs · Mathematics 2015-04-09 Stefan Hilger

This paper investigates entropic matroids, that is, matroids whose rank function is given as the Shannon entropy of random variables. In particular, we consider $p$-entropic matroids, for which the random variables each have support of…

Information Theory · Computer Science 2019-10-23 Emmanuel Abbe , Sophie Spirkl

A representation of partially spatially coherent and partially polarized stationary electromagnetic fields is given in terms of mutually uncorrelated, transversely shifted, fully coherent and polarized elementary electric-field modes. This…

Optics · Physics 2015-05-19 Jani Tervo , Jari Turunen , Pasi Vahimaa , Frank Wyrowski

A hypergraph G with n vertices and m hyperedges with d endpoints each is (k,l)-sparse if for all sub-hypergraphs G' on n' vertices and m' edges, m'\le kn'-l. For integers k and l satisfying 0\le l\le dk-1, this is known to be a linearly…

Combinatorics · Mathematics 2010-12-21 Ileana Streinu , Louis Theran

The {\em Dressian} of a matroid $M$ is the set of all valuations of $M$. This Dressian is the support of a polyhedral complex $\mathcal{Dr}(M)$ whose open cells correspond 1-1 with matroid subdivisions of the matroid polytope of $M$. We…

Combinatorics · Mathematics 2024-08-20 Rudi Pendavingh

Two representations of a reductive group G are spectrally equivalent if the same irreducible representations appear in both of them. The semigroup of finite dimensional representations of G with tensor product and up to spectral equivalence…

Representation Theory · Mathematics 2010-03-02 Kiumars Kaveh , Askold G. Khovanskii

We analyze a combinatorial rule satisfied by the signs of principal minors of a real symmetric matrix. The sign patterns satisfying this rule are equivalent to uniform oriented Lagrangian matroids. We first discuss their structure and…

Combinatorics · Mathematics 2025-01-31 Tobias Boege , Jesse Selover , Maksym Zubkov

Let k be a perfect field, and K be a totally ramified extension of K_0 = Frac W(k) of degree e. To a semi-stable p-adic representation of G_K (the absolute Galois group of K), one can classicaly associate two polygons : the Hodge polygon et…

Number Theory · Mathematics 2008-06-13 Xavier Caruso , David Savitt

We investigate valuated matroids with an additional algebraic structure on their residue matroids. We encode the structure in terms of representability over stringent hyperfields. A hyperfield $H$ is {\em stringent} if $a\boxplus b$ is a…

Combinatorics · Mathematics 2023-03-15 Nathan Bowler , Rudi Pendavingh

We construct a new family of minimal non-orientable matroids of rank three. Some of these matroids embed in Desarguesian projective planes. This answers a question of Ziegler: for every prime power $q$, find a minimal non-orientable…

Combinatorics · Mathematics 2022-02-22 Rigoberto Florez , David Forge

In this paper we prove that every random variable of the form $F(M_T)$ with $F:\real^d \to\real$ a Borelian map and $M$ a $d$-dimensional continuous Markov martingale with respect to a Markov filtration $\mathcal{F}$ admits an exact…

Probability · Mathematics 2011-08-22 Anthony Reveillac

A well-known result on Lie Theory states that every finite-dimensional complex solvable Lie algebra can be represented as a matrix Lie algebra, with upper-triangular square matrices as elements. However, this result does not specify which…

Representation Theory · Mathematics 2014-04-15 Manuel Ceballos , Juan Núñez , Ángel F. Tenorio

The aim of this article is to prove a representation theorem for orthogonally additive polynomials in the spirit of the recent theorem on representation of orthogonally additive polynomials on Banach lattices but for the setting of Riesz…

Functional Analysis · Mathematics 2012-03-13 A. Ibort , P. Linares , J. G. Llavona

A representation field for a non-maximal order $\Ha$ in a central simple algebra is a subfield of the spinor class field of maximal orders which determines the set of spinor genera of maximal orders containing a copy of $\Ha$. Not every…

Number Theory · Mathematics 2011-04-12 Luis Arenas-Carmona

Consider a convex set S defined by a matrix inequality of polynomials or rational functions over a domain. The set S is called semidefinite programming (SDP) representable or just semidefinite representable if it equals the projection of a…

Optimization and Control · Mathematics 2011-03-30 Jiawang Nie