English
Related papers

Related papers: Representations of torsion-free arithmetic matroid…

200 papers

We represent low dimensional quantum mechanical Hamiltonians by moderately sized finite matrices that reproduce the lowest O(10) boundstate energies and wave functions to machine precision. The method extends also to Hamiltonians that are…

Quantum Physics · Physics 2015-06-03 Johann Foerster , Alejandro Saenz , Ulli Wolff

We introduce a compressed representation of sets of sets that exploits how much they differ from each other. Our representation supports access, membership, predecessor and successor queries on the sets within logarithmic time. In addition,…

Data Structures and Algorithms · Computer Science 2026-02-02 Travis Gagie , Meng He , Gonzalo Navarro

We extend the notion of representation of a matroid to algebraic structures that we call skew partial fields. Our definition of such representations extends Tutte's definition, using chain groups. We show how such representations behave…

Combinatorics · Mathematics 2012-12-12 R. A. Pendavingh , S. H. M. van Zwam

We determine all the multiplicity-free representations of the symmetric group. This project is motivated by a combinatorial problem involving systems of set-partitions with a specific pattern of intersection.

Representation Theory · Mathematics 2009-03-03 Chris Godsil , Karen Meagher

Let $r \leqslant n$ be nonnegative integers, and let $N = \binom{n}{r} - 1$. For a matroid $M$ of rank $r$ on the finite set $E = [n]$ and a partial field $k$ in the sense of Semple--Whittle, it is known that the following are equivalent:…

Combinatorics · Mathematics 2024-01-02 Matthew Baker , Tong Jin

Seymour's decomposition theorem for regular matroids is a fundamental result with a number of combinatorial and algorithmic applications. In this work we demonstrate how this theorem can be used in the design of parameterized algorithms on…

Data Structures and Algorithms · Computer Science 2017-10-09 Fedor V. Fomin , Petr A. Golovach , Daniel Lokshtanov , Saket Saurabh

We consider the GF$(4)$-representable matroids with a circuit-hyperplane such that the matroid obtained by relaxing the circuit-hyperplane is also GF$(4)$-representable. We characterize the structure of these matroids as an application of…

Combinatorics · Mathematics 2018-06-04 Ben Clark , James Oxley , Stefan H. M. van Zwam

The Tutte polynomial for matroids is not directly applicable to polymatroids. For instance, deletion-contraction properties do not hold. We construct a polynomial for polymatroids which behaves similarly to the Tutte polynomial of a…

Combinatorics · Mathematics 2016-04-05 Amanda Cameron , Alex Fink

In this article we introduce theory and algorithms for learning discrete representations that take on a lattice that is embedded in an Euclidean space. Lattice representations possess an interesting combination of properties: a) they can be…

Machine Learning · Computer Science 2020-06-25 Luis A. Lastras

A 1965 result of Crapo shows that every elementary lift of a matroid $M$ can be constructed from a linear class of circuits of $M$. In a recent paper, Walsh generalized this construction by defining a rank-$k$ lift of a matroid $M$ given a…

Combinatorics · Mathematics 2025-02-19 Daniel Irving Bernstein , Zach Walsh

We describe a construction of the Tutte polynomial for both matroids and $q$-matroids based on an appropriate partition of the underlying support lattice into intervals that correspond to prime-free minors, which we call a Tutte partition.…

Combinatorics · Mathematics 2024-11-12 Eimear Byrne , Andrew Fulcher

Birkhoff's representation theorem (Birkhoff, 1937) defines a bijection between elements of a distributive lattice and the family of upper sets of an associated poset. Although not used explicitly, this result is at the backbone of the…

Combinatorics · Mathematics 2021-06-02 Yuri Faenza , Xuan Zhang

We show new algorithms and constructions over linear delta-matroids. We observe an alternative representation for linear delta-matroids, as a contraction representation over a skew-symmetric matrix. This is equivalent to the more standard…

Data Structures and Algorithms · Computer Science 2024-02-20 Tomohiro Koana , Magnus Wahlström

A matroid is a machine capturing linearity of mathematical objects and producing combinatorial structures. Matroid structure arises everywhere since linearity is a ubiquitous concept. One natural way to obtain matroids is by considering…

Combinatorics · Mathematics 2023-03-14 Jaeho Shin

The main purpose of this paper is providing a simple method to generate the matrices of irreducible representations because it is useful to reduce the computational time of solving the eigenvalue problems. The only information we need to…

Mathematical Physics · Physics 2007-08-07 Young-Chung Hsue

Hereunder we continue the study of the representation theory of the algebra of permutation operators acting on the $n$-fold tensor product space, partially transposed on the last subsystem. We develop the concept of partially reduced…

Quantum Physics · Physics 2018-03-14 Marek Mozrzymas , Michał Studziński , Michał Horodecki

In this paper we construct a new factorized representation of the $R$-matrix related to the affine algebra $U_{q}(\widehat{sl_{n}})$ for symmetric tensor representations with arbitrary weights. Using the 3D approach we obtain explicit…

Mathematical Physics · Physics 2016-12-21 Gary Bosnjak , Vladimir V. Mangazeev

The paper develops elementary linear algebra methods to compute the determinants of the tensor symmetrizations of quadratic and hermitian forms over fields of good characteristic. Explicit results are given for the partitions $(n)$,…

Combinatorics · Mathematics 2024-09-26 Gabriele Nebe

We study the representation of a finite group acting on the cohomology of a non-degenerate, invariant hypersurface of a projective toric variety. We deduce an explicit description of the representation when the toric variety has at worst…

Representation Theory · Mathematics 2014-12-05 Alan Stapledon

This dissertation presents new results on three different themes all related to matroid polytopes. First we investigate properties of Ehrhart polynomials of matroid polytopes, independence matroid polytopes, and polymatroids. We prove that…

Combinatorics · Mathematics 2009-05-28 David C. Haws