English
Related papers

Related papers: Cyclotomic and simplicial matroids

200 papers

A $q$-matroid is the analogue of a matroid which arises by replacing the finite ground set of a matroid with a finite-dimensional vector space over a finite field. These $q$-matroids are motivated by coding theory as the representable…

Combinatorics · Mathematics 2025-11-27 Sebastian Degen , Lukas Kühne

The first problem we investigate is the following: given $k\in \mathbb{R}_{\ge 0}$ and a vector $v$ of Pl\"ucker coordinates of a point in the real Grassmannian, is the vector obtained by taking the $k$th power of each entry of $v$ again a…

Combinatorics · Mathematics 2019-10-03 Matthias Lenz

Suppose $ m,n\geq 2 $ are co prime integers. We prove certain new symmetries of the base $ n $ representation of $ 1/m $, and in particular characterize the subgroup generated by $ n $ inside $ (\mathbb{Z}/m\mathbb{Z})^\times $. As an…

Number Theory · Mathematics 2021-07-27 Kalyan Chakraborty , Krishnarjun Krishnamoorthy

The singleton and doubleton minors of a polymatroid $\rho$ encode a surprising amount of information about the structural complexity of $\rho$. Given any polymatroid $\rho$, we can subtract from it a maximally-separated polymatroid,…

Combinatorics · Mathematics 2023-12-01 Fiona Young

The natural matroid of an integer polymatroid was introduced to show that a simple construction of integer polymatroids from matroids yields all integer polymatroids. As we illustrate, the natural matroid can shed much more light on integer…

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

The main object of study in this paper is the completion Z[q]^N=\varprojlim_n Z[q]/((1-q)(1-q^2)...(1-q^n)) of the polynomial ring Z[q], which arises from the study of a new invariant of integral homology 3-spheres with values in Z[q]^N…

Commutative Algebra · Mathematics 2007-05-23 Kazuo Habiro

In this article we prove that (1-zeta+zeta^2) is a unit in the ring of integers of the cyclotomic field where zeta is a primitive n-th root of unity and n is coprime to 2 and 3. We also prove that for prime n,…

Number Theory · Mathematics 2011-09-14 Alexandre Aksenov

We introduce the notion of a matroid M over a commutative ring R, assigning to every subset of the ground set an R-module according to some axioms. When R is a field, we recover matroids. When R=$\mathbb{Z}$, and when R is a DVR, we get…

Combinatorics · Mathematics 2019-11-19 Alex Fink , Luca Moci

We present a simple proof of the fact that the base (and independence) polytope of a rank $n$ regular matroid over $m$ elements has an extension complexity $O(mn)$.

Discrete Mathematics · Computer Science 2017-02-08 Rohit Gurjar , Nisheeth K. Vishnoi

Consider a random $n\times m$ matrix $A$ over the finite field of order $q$ where every column has precisely $k$ nonzero elements, and let $M[A]$ be the matroid represented by $A$. In the case that q=2, Cooper, Frieze and Pegden (RS\&A…

Combinatorics · Mathematics 2024-01-22 Pu Gao , Peter Nelson

We introduce the Z-polynomial of a matroid, which we define in terms of the Kazhdan-Lusztig polynomial. We then exploit a symmetry of the Z-polynomial to derive a new recursion for Kazhdan-Lusztig coefficients. We solve this recursion,…

Combinatorics · Mathematics 2017-06-20 Nicholas Proudfoot , Ben Young , Yuan Xu

This paper presents a novel primality test based on the eigenvalue structure of circulant matrices constructed from roots of unity. We prove that an integer $n > 2$ is prime if and only if the minimal polynomial of the circulant matrix $C_n…

Symbolic Computation · Computer Science 2025-05-05 Marius-Constantin Dinu

We show that the Schur polynomials in all primitive $n$th roots of unity are $1$, $0$, or $-1$, if $n$ has at most two distinct odd prime factors. This result can be regarded as a generalization of properties of the coefficients of the…

Combinatorics · Mathematics 2025-09-16 Masaki Hidaka , Minoru Itoh

The Tutte polynomial of a connected graph was originally defined by Tutte as a sum over all spanning trees of monomials depending on a fixed linear order on the set of edges. Tuttle proved that while these monomials do depend on the linear…

Combinatorics · Mathematics 2016-04-19 Nikolai V. Ivanov

We associate to every matroid M a polynomial with integer coefficients, which we call the Kazhdan-Lusztig polynomial of M, in analogy with Kazhdan-Lusztig polynomials in representation theory. We conjecture that the coefficients are always…

Combinatorics · Mathematics 2016-07-04 Ben Elias , Nicholas Proudfoot , Max Wakefield

Luis Ferroni and Alex Fink recently introduced a polytope of all unlabeled matroids of rank $r$ on $n$ elements, and they showed that the vertices of this polytope come from matroids that can be characterized by maximizing a sequence of…

Combinatorics · Mathematics 2025-12-23 Joseph E. Bonin

Let $p$ be a prime, let $d \geq 1$ be an integer and $A$ be the algebra of square matrices of size $d$ over the field of order $p$. Let $P, Q \in A[x_1, \dots x_n]$ be polynomials in $n$ indeterminates with coefficients in $A$, such that…

Combinatorics · Mathematics 2026-05-22 Pierre-Emmanuel Caprace , Justin Vast

By introducing a generalized notion of multiple zeta values associated with an arbitrary finite subset $S\subset \mathbb{P}^1(\mathbb{C})$ and studying their transformation properties under rational functions, we show that multiple…

Number Theory · Mathematics 2026-01-05 Kam Cheong Au

In this paper, we show that Oda's question holds for $n$-dimensional simplicial reflexive polytope $P$ and lattice polytope $Q$ containing the origin, when the vertex of $Q$ is either a vertex of $P$ or the origin, provided that $P$ has no…

Combinatorics · Mathematics 2025-11-07 Binnan Tu

Cyclotomic coset is a classical notion in the theory of finite field which has wide applications in various computation problems. Let $q$ be a prime power, and $n$ be a positive integer coprime to $q$. In this paper we determine explicitly…

Information Theory · Computer Science 2025-05-20 Li Zhu , Jinle Liu , Hongfeng Wu