English
Related papers

Related papers: Cocharacters of polynomial identities of upper tri…

200 papers

In this paper we study the growth of the differential identities of some algebras with derivations, i.e., associative algebras where a Lie algebra $L$ (and its universal enveloping algebra $U(L)$) acts on them by derivations. In particular,…

Rings and Algebras · Mathematics 2020-07-09 Carla Rizzo

In the paper we provide some polynomial identities for finite-dimensional algebras. A list of well known single polynomial identities is exposed and the classification of all $2$-dimensional algebras with respect to these identities is…

Rings and Algebras · Mathematics 2020-01-03 H. Ahmed , U. Bekbaev , I. Rakhimov

A cofactor representation of an ideal element, that is, a representation in terms of the generators, can be considered as a certificate for ideal membership. Such a representation is typically not unique, and some can be a lot more…

Symbolic Computation · Computer Science 2024-04-10 Clemens Hofstadler , Thibaut Verron

Character polynomials are used to study the restriction of a polynomial representation of a general linear group to its subgroup of permutation matrices. A simple formula is obtained for computing inner products of class functions given by…

Representation Theory · Mathematics 2021-12-07 Sridhar Narayanan , Digjoy Paul , Amritanshu Prasad , Shraddha Srivastava

In this paper, we study the characters of homogeneous monotonic P-polynomial table algebras with finite dimension d>=5. We then apply them to association schemes. To this end, we develop some methods using tridiagonal matrices and…

Combinatorics · Mathematics 2019-07-11 Masoumeh Koohestani , Amir Rahnamai Barghi , Amirhossein Amiraslani

An algorithm for resolution of singularities in characteristic zero is described. It is expressed in terms of multi-ideals, that essentially are defined as a finite sequence of pairs, each one consiting of a sheaf of ideals and a positive…

Algebraic Geometry · Mathematics 2013-04-10 Augusto Nobile

With a main tool is signed graphs, we give a full description of the characteristic quasi-polynomials of ideals of classical root systems ($ABCD$) with respect to the integer and root lattices. As a result, we obtain a full description of…

Combinatorics · Mathematics 2019-12-30 Tan Nhat Tran

In this paper we study the equations of the elimination ideal associated with $n+1$ generic multihomogeneous polynomials defined over a product of projective spaces of dimension $n$. We first prove a duality property and then make this…

Commutative Algebra · Mathematics 2022-07-05 Laurent Busé , Marc Chardin , Navid Nemati

In this paper we present an algorithm for computing all algebraic intermediate subfields in a separably generated unirational field extension (which in particular includes the zero characteristic case). One of the main tools is Groebner…

Symbolic Computation · Computer Science 2008-05-15 Jaime Gutierrez , David Sevilla

Using a certain Pick-type formula for the mixed volume of Cayley polyhedra, we compute the multiplicity of the isolated common zero of the maximal minors for a matrix of generic homogeneous polynomials of given degrees.

Combinatorics · Mathematics 2013-08-22 Alexander Esterov

A minimal homogeneous generating system of the algebra of semi-invariants of tuples of two-by-two matrices over an infinite field of characteristic two or over the ring of integers is given. In an alternative interpretation this yields a…

Commutative Algebra · Mathematics 2020-01-01 M. Domokos

In this paper we extend the cocharacter theory to generalized identities of $W$-algebras. We prove that the Hilbert series of the relatively free $W$-algebra admits an expansion in terms of Schur functions whose coefficients coincide with…

Rings and Algebras · Mathematics 2025-08-04 Sebastiano Argenti , Giovanni Busalacchi

Ouroboros functions have shown some interesting properties when subjected to conventional operations. The aim of this paper is to continue our investigation and prove some additional properties of these functions. Using algebraic methods,…

General Mathematics · Mathematics 2021-07-06 Nathan Thomas Provost

Several problems in computer algebra can be efficiently solved by reducing them to calculations over finite fields. In this paper, we describe an algorithm for the reconstruction of multivariate polynomials and rational functions from their…

High Energy Physics - Phenomenology · Physics 2016-12-14 Tiziano Peraro

In this article we present a method to implement orthogonal polynomials and many other special functions in Computer Algebra systems enabling the user to work with those functions appropriately, and in particular to verify different types…

Classical Analysis and ODEs · Mathematics 2016-09-06 Wolfram Koepf

A characteristic pair is a pair (G,C) of polynomial sets in which G is a reduced lexicographic Groebner basis, C is the minimal triangular set contained in G, and C is normal. In this paper, we show that any finite polynomial set P can be…

Symbolic Computation · Computer Science 2017-03-01 Dongming Wang , Rina Dong , Chenqi Mou

Even with the introduction of supercharacter theories, the representation theory of many unipotent groups remains mysterious. This paper constructs a family of supercharacter theories for normal pattern groups in a way that exhibit many of…

Representation Theory · Mathematics 2015-12-14 Nathaniel Thiem

Let $A$ be an associative algebra graded by a finite group $G$ over a field ${F}$ of characteristic zero. One associates to $A$ the sequence of $G$-graded codimensions $c_n^G(A)$, $n=1,2,\ldots$, which measures the growth of the polynomial…

Rings and Algebras · Mathematics 2026-02-03 Wesley Quaresma Cota

We develop a method to construct algebraic invariants for hypermatrices. We then construct hyperdeterminants and exhibit a generalization of the Cayley-Hamilton theorem for hypermatrices.

Mathematical Physics · Physics 2007-05-23 Victor Tapia

The roots of any polynomial of degree m with complex integer coefficients can be computed by manipulation of sequences made from distinct symbols and counting the different symbols in the sequences. This method requires only primitive…

General Mathematics · Mathematics 2007-05-23 Ashok Kumar Mittal , Ashok Kumar Gupta
‹ Prev 1 4 5 6 7 8 10 Next ›