English
Related papers

Related papers: Matroidal Root Structure of Skew Polynomials over …

200 papers

Given a homogeneous ideal $I$ in a polynomial ring over a field, one may record, for each degree $d$ and for each polynomial $f\in I_d$, the set of monomials in $f$ with nonzero coefficients. These data collectively form the tropicalization…

Algebraic Geometry · Mathematics 2021-03-01 Rob Silversmith

The classical matrix tree theorem relates the number of spanning trees of a connected graph with the product of the nonzero eigenvalues of its Laplacian matrix. The class of regular matroids generalizes that of graphical matroids, and a…

Combinatorics · Mathematics 2014-05-12 Aaron Dall , Julian Pfeifle

In [1] Peters and Regts confirmed a conjecture by Sokal by showing that for every $\Delta \in \mathbb{Z}_{\geq 3}$ there exists a complex neighborhood of the interval $\left[0, \frac{\left(\Delta - 1\right)^{\Delta -…

Combinatorics · Mathematics 2019-03-14 Pjotr Buys

In this article, we study polymatroids that are representable by means of linear restricted rank-metric codes, namely, by subspaces of the space of alternating, symmetric, or Hermitian square matrices endowed with the rank metric. More…

Combinatorics · Mathematics 2026-02-20 Eimear Byrne , Giovanni Longobardi , and Rocco Trombetti

We introduce a new concept of rank - relative rank associated to a filtered collection of polynomials. When the filtration is trivial our relative rank coincides with Schmidt rank (also called strength). We also introduce the notion of…

Commutative Algebra · Mathematics 2024-03-07 Amichai Lampert , Tamar Ziegler

To directed graphs with unique sink and source we associate a noncommutative associative alsgebra and a polynomial over this algebra. Edges of the graph correspond to pseudo-roots of the polynomial. We give a sufficient condition when…

Quantum Algebra · Mathematics 2009-11-11 Israel Gelfand , Sergei Gelfand , Vladimir Retakh , Robert Lee Wilson

Given a graph $G$ of order $n$, the $\sigma$-$polynomial$ of $G$ is the generating function $\sigma(G,x) = \sum a_{i}x^{i}$ where $a_{i}$ is the number of partitions of the vertex set of $G$ into $i$ nonempty independent sets. Such…

Combinatorics · Mathematics 2017-08-29 Jason Brown , Aysel Erey

This is a survey on the theory of skew-cyclic codes based on skew-polynomial rings of automorphism type. Skew-polynomial rings have been introduced and discussed by Ore (1933). Evaluation of skew polynomials and sets of (right) roots were…

Information Theory · Computer Science 2019-03-05 Heide Gluesing-Luerssen

The trigonometric monomial $\cos(\left\langle k, x \right\rangle)$ on $\mathbb{T}^d$, a harmonic polynomial $p: \mathbb{S}^{d-1} \rightarrow \mathbb{R}$ of degree $k$ and a Laplacian eigenfunction $-\Delta f = k^2 f$ have root in each ball…

Classical Analysis and ODEs · Mathematics 2023-01-18 Stefan Steinerberger

The notion of a root functional of a system of polynomials or ideal of polynomials is a generalization of the notion of a root, in particular, for a multiple root. A root functional is a linear functional that is defined on a polynomial…

Commutative Algebra · Mathematics 2009-02-02 Timur R. Seifullin

Generalizing supertropical algebras, we present a "layered" structure, "sorted" by a semiring which permits varying ghost layers, and indicate how it is more amenable than the "standard" supertropical construction in factorizations of…

Commutative Algebra · Mathematics 2011-08-16 Zur Izhakian , Manfred Knebusch , Louis Rowen

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

For k a field of arbitrary characteristic, and R a k-algebra, we show that the PI degree of an iterated skew polynomial ring R[x_1;\tau_1,\delta_1]...b[x_n;\tau_n,\delta_n] agrees with the PI degree of R[x_1;\tau_1]...b[x_n;\tau_n] when…

Rings and Algebras · Mathematics 2007-05-23 Heidi Haynal

A polynomial ring with rational coefficients is an irreducible representation of Lie algebras of endomorphisms of exterior powers of a infinite countable dimensional $\mathbb{Q}$-vector space. We give an explicit description of it, using…

Algebraic Geometry · Mathematics 2020-05-19 Ommolbanin Behzad , Andre Contiero , Letterio Gatto , Renato Vidal Martins

After recalling the definition of codes as modules over skew polynomial rings, whose multiplication is defined by using an automorphism and a derivation, and some basic facts about them, in the first part of this paper we study some of…

Information Theory · Computer Science 2015-07-13 Luis Felipe Tapia Cuitiño , Andrea Luigi Tironi

Given a subgroup $\mathcal{H}$ of a product of finite groups $\mathcal{G} = \displaystyle\prod^n_{i=1} \Gamma_i$ and $b>1,$ we define a polymatroid $P(\mathcal{H},b).$ If all of the $\Gamma_i$ are isomorphic to $\mathbb{Z}/p\mathbb{Z},$ $p$…

Combinatorics · Mathematics 2024-02-28 Ed Swartz , Prairie Wentworth-Nice , Alexander Xue

We present a framework for the construction of linearizations for scalar and matrix polynomials based on dual bases which, in the case of orthogonal polynomials, can be described by the associated recurrence relations. The framework…

Numerical Analysis · Mathematics 2016-07-06 Leonardo Robol , Raf Vandebril , Paul Van Dooren

Regarding polynomial functions on a subset $S$ of a non-commutative ring $R$, that is, functions induced by polynomials in $R[x]$ (whose variable commutes with the coefficients), we show connections between, on one hand, sets $S$ such that…

Rings and Algebras · Mathematics 2018-09-26 Sophie Frisch

Let $K$ be a field, complete with respect to a discrete non-archimedian valuation and let $k$ be the residue field. Consider a system $F$ of $n$ polynomial equations in $K\vars$. Our first result is a reformulation of the classical Hensel's…

Algebraic Geometry · Mathematics 2011-07-07 Martin Avendano , Ashraf Ibrahim

The independence polynomial of a graph is the generating polynomial for the number of independent sets of each size, and its roots are called {\em independence roots}. We investigate the stability of such polynomials, that is, conditions…

Combinatorics · Mathematics 2018-02-08 Jason Brown , Ben Cameron
‹ Prev 1 8 9 10 Next ›