English
Related papers

Related papers: Representations of weakly multiplicative arithmeti…

200 papers

A flat cover is a collection of flats identifying the non-bases of a matroid. We introduce the notion of cover complexity, the minimal size of such a flat cover, as a measure for the complexity of a matroid, and present bounds on the number…

Combinatorics · Mathematics 2013-03-01 R. A. Pendavingh , J. G. van der Pol

Given a linear map $T$ on a Euclidean Jordan algebra of rank $n$, we consider the set of all nonnegative vectors $q$ in $R^n$ with decreasing components that satisfy the pointwise weak-majorization inequality…

Functional Analysis · Mathematics 2020-08-18 Muddappa Gowda , Jeong Juyoung

Using a binary representation for basis elements of an algebra combined with a framework of multiplier and index functions, a connection has been established between the structure of a large class of algebras and the XOR componentwise…

Mathematical Physics · Physics 2025-09-30 Derek Courchesne , Sébastien Tremblay

A weakly equivariant Hopf algebra is a Hopf algebra A with an action of a finite group G up to inner automorphisms. We show that each weakly equivariant Hopf algebra can be replaced by a Morita equivalent algebra B with a strict action of G…

Rings and Algebras · Mathematics 2012-05-07 Jennifer Maier , Thomas Nikolaus , Christoph Schweigert

We study a class of overdetermined algebraic systems of equations. We prove that the number of distinct solutions equals to the maximal possible if and only if certain matrices are commuting and semisimple. This gives a characterization of…

Algebraic Geometry · Mathematics 2025-10-20 H. Hakopian , M. Tonoyan

Every bi-uniform matroid is representable over all sufficiently large fields. But it is not known exactly over which finite fields they are representable, and the existence of efficient methods to find a representation for every given…

Combinatorics · Mathematics 2014-07-29 Simeon Ball , Carles Padró , Zsuzsa Weiner , Chaoping Xing

We study the algorithmic problem of multiplying large matrices that are rectangular. We prove that the method that has been used to construct the fastest algorithms for rectangular matrix multiplication cannot give algorithms with…

Computational Complexity · Computer Science 2025-11-10 Matthias Christandl , François Le Gall , Vladimir Lysikov , Jeroen Zuiddam

Strongly quadrangular matrices have been introduced in the study of the combinatorial properties of unitary matrices. It is known that if a (0, 1)-matrix supports a unitary then it is strongly quadrangular. However, the converse is not…

Combinatorics · Mathematics 2008-07-17 Simone Severini , Ferenc Szöllősi

We prove that for each prime power $q$ there is an integer $n$ such that if $M$ is a $3$-connected, representable matroid with a PG$(n-1,q)$-minor and no $U_{2,q^2+1}$-minor, then $M$ is representable over GF$(q)$. We also show that for…

Combinatorics · Mathematics 2015-03-31 Jim Geelen , Rohan Kapadia

We construct the algebra of fractions of a Weak Bialgebra relative to a suitable denominator set of group-like elements that is `almost central', a condition we introduce in the present article which is sufficient in order to guarantee…

Quantum Algebra · Mathematics 2013-08-09 Steve Bennoun , Hendryk Pfeiffer

A partial field is an algebraic object that allows one to simultaneously abstract several different representability properties of matroids. In this paper we study partial fields as algebraic objects in their own right. We characterize the…

Combinatorics · Mathematics 2025-10-17 Nathaniel Vaduthala

A matroid is $\text{GF}(q)$-regular if it is representable over all proper superfields of the field $\text{GF}(q)$. We show that, for highly connected matroids having a large projective geometry over $\text{GF}(q)$ as a minor, the property…

Combinatorics · Mathematics 2014-01-29 Peter Nelson , Stefan H. M. van Zwam

The property of balance (in the sense of Feder and Mihail) is investigated in the context of paving matroids. The following examples are exhibited: (a) a class of ``sparse'' paving matroids that are balanced, but at the same time rich…

Combinatorics · Mathematics 2007-05-23 Mark Jerrum

Polymatroids can be considered as "fractional matroid" where the rank function is not required to be integer valued. Many, but not every notion in matroid terminology translates naturally to polymatroids. Defining cyclic flats of a…

Combinatorics · Mathematics 2019-10-15 Laszlo Csirmaz

We prove that the cohomology class of any curve on a very general principally polarized abelian variety of dimension at least 4 is an even multiple of the minimal class. The same holds for the intermediate Jacobian of a very general cubic…

Algebraic Geometry · Mathematics 2026-03-31 Philip Engel , Olivier de Gaay Fortman , Stefan Schreieder

We prove that a monomial ideal $I$ generated in a single degree, is polymatroidal if and only if it has linear quotients with respect to the lexicographical ordering of the minimal generators induced by every ordering of variables. We also…

Commutative Algebra · Mathematics 2018-08-21 Somayeh Bandari , Rahim Rahmati-Asghar

There are many similarities between the theories of matroids and $q$-matroids. However, when dealing with the direct sum of $q$-matroids many differences arise. Most notably, it has recently been shown that the direct sum of representable…

Combinatorics · Mathematics 2026-03-11 Gianira N. Alfarano , Relinde Jurrius , Alessandro Neri , Ferdinando Zullo

We establish the $\#P$-hardness of computing a broad class of immanants, even when restricted to specific categories of matrices. Concretely, we prove that computing $\lambda$-immanants of $0$-$1$ matrices is $\#P$-hard whenever the…

Computational Complexity · Computer Science 2025-11-21 Istvan Miklos , Cordian Riener

We develop the rudiments of a finite-dimensional representation theory of groups over idempotent semifields by considering linear actions on tropical linear spaces. This can be considered a tropical representation theory, a characteristic…

Representation Theory · Mathematics 2018-10-23 Noah Giansiracusa , Jacob Manaker

The weak-strong uniqueness of solutions to a broad class of cross-diffusion systems with volume filling is established. In general, the diffusion matrices are neither symmetric nor positive definite. This issue is overcome by supposing that…

Analysis of PDEs · Mathematics 2025-10-01 Maria Heitzinger , Ansgar Jüngel