English
Related papers

Related papers: Note on E-polynomials associated to $\mathbb{Z}_4$…

200 papers

We provide an algorithm that computes a set of generators for any complete ideal in a smooth complex surface. More interestingly, these generators admit a presentation as monomials in a set of maximal contact elements associated to the…

Algebraic Geometry · Mathematics 2017-10-31 Maria Alberich-Carramiñana , Josep Alvarez Montaner , Guillem Blanco

We introduce new polynomial invariants of a finite-dimensional semisimple and cosemisimple Hopf algebra A over a field by using the braiding structures of A. We investigate basic properties of the polynomial invariants including stability…

Quantum Algebra · Mathematics 2009-07-02 Michihisa Wakui

In this paper, we prove that the ring of polynomial invariants of the Weyl group for an indecomposable and indefinite Kac-Moody Lie algebra is generated by invariant symmetric bilinear form or is trivial depending on $A$ is symmetrizable or…

Commutative Algebra · Mathematics 2016-01-20 Zhao Xu-an , Jin Chunhua

The methods of classical invariant theory are used to construct generic polynomials for groups $S_5$ and $A_5$, along with explicit reductions to specializations of the generic polynomials defining any desired field extension with those…

Number Theory · Mathematics 2012-10-19 Gene Ward Smith

We construct a class of three-Lee-weight and two infinite families of five-Lee-weight codes over the ring $R=\mathbb{F}_2 +v\mathbb{F}_2 +v^2\mathbb{F}_2 +v^3\mathbb{F}_2 +v^4\mathbb{F}_2,$ where $v^5=1.$ The same ring occurs in the quintic…

Information Theory · Computer Science 2017-01-05 Yan Liu , Minjia Shi , Patrick Solé

Recently the algebraic structure of gauge-invariant operators in multi-matrix quantum mechanics has been clarified: this space forms a module over a freely generated ring. The ring is generated by a set of primary invariants, while the…

High Energy Physics - Theory · Physics 2025-12-19 Robert de Mello Koch , Minkyoo Kim , Hendrik J. R. Van Zyl

We consider a class of linear codes associated to projective algebraic varieties defined by the vanishing of minors of a fixed size of a generic matrix. It is seen that the resulting code has only a small number of distinct weights. The…

Combinatorics · Mathematics 2016-04-26 Peter Beelen , Sudhir R. Ghorpade , Sartaj Ul Hasan

In this paper we give a factorization theorem for the ring of exponential polynomials in many variables over an algebraically closed field of characteristic 0 with an exponentiation. This is a generalization of the factorization theorem due…

Rings and Algebras · Mathematics 2012-06-29 P. D'Aquino , G. Terzo

For any finite partially ordered set $P$, the $P$-Eulerian polynomial is the generating function for the descent number over the set of linear extensions of $P$, and is closely related to the order polynomial of $P$ arising in the theory of…

Combinatorics · Mathematics 2024-09-11 T. Kyle Petersen , Yan Zhuang

The study of images of noncommutative polynomials on algebras has attracted considerable attention. We investigate polynomial images and the additive structures they generate in associative algebras, focusing on sums and products of values.…

Rings and Algebras · Mathematics 2026-05-07 Tsiu-Kwen Lee , Tran Nam Son

Associated to any closed subgroup $G\subset U_N^+$ is a family of toral subgroups $T_Q\subset G$, indexed by the unitary matrices $Q\in U_N$. The family $\{T_Q|Q\in U_N\}$ is expected to encode the main properties of $G$, and there are…

Operator Algebras · Mathematics 2019-11-12 Teo Banica

A polynomial is presented that models a topological knot in a unique manner. It distinguishes all types of knots including the orientation and has a group theory interpretation. The topologies may be labeled via a number, which upon a base…

General Physics · Physics 2007-05-23 Gordon Chalmers

We construct a class of $\mathbb{Z}_2\mathbb{Z}_4$-additive cyclic codes generated by pairs of polynomials, study their algebraic structures, and obtain the generator matrix of any code in the class. Using a probabilistic method, we prove…

Information Theory · Computer Science 2019-11-22 Yun Fan , Hualu Liu

This paper presents four new classes of binary quantum codes with minimum dis- tance 3 and 4, namely Class-I, Class-II, Class-III and Class-IV. The classes Class-I and Class-II are constructed based on self-dual orientable embeddings of the…

Quantum Physics · Physics 2015-07-07 Avaz Naghipour , Mohammad Ali Jafarizadeh , Sedaghat Shahmorad

For $(n,d)= (66,17),(78,19)$ and $(94,21)$, we construct quantum $[[n,0,d]]$ codes which improve the previously known lower bounds on the largest minimum weights among quantum codes with these parameters. These codes are constructed from…

Combinatorics · Mathematics 2020-11-20 Masaaki Harada

In this work a new strategy is proposed in order to build analytic and microscopic models of fluctuating polymer rings subjected to topological constraints. The topological invariants used to fix these constraints belong to a wide class of…

Statistical Mechanics · Physics 2020-01-08 Franco Ferrari

Generalizing polynomials previously studied in the context of linear codes, we define weight polynomials and an enumerator for a matroid $M$. Our main result is that these polynomials are determined by Betti numbers associated with graded…

Combinatorics · Mathematics 2015-11-13 Trygve Johnsen , Jan Roksvold , Hugues Verdure

In this note, we show the polynomiality of the ring of invariants with respect to the Weyl group of type $A_{2l}^{(2)}$.

Representation Theory · Mathematics 2019-06-28 Kenji Iohara , Yosihisa Saito

Chevalley's theorem states that for any simple finite dimensional Lie algebra G (1) the restriction homomorphism of the algebra of polynomials on G onto the Cartan subalgebra H induces an isomorphism between the algebra of G-invariant…

Representation Theory · Mathematics 2007-05-23 Alexander Sergeev

For an arbitrary undirected simple graph G with m edges, we give an algorithm with running time O(m^4 |L|^2) to generate the set L of all minimal edge dominating sets of G. For bipartite graphs we obtain a better result; we show that their…

Data Structures and Algorithms · Computer Science 2012-10-24 Petr A. Golovach , Pinar Heggernes , Dieter Kratsch , Yngve Villanger
‹ Prev 1 8 9 10 Next ›