Related papers: Character Polynomials and the Restriction Problem
Suppose that W is a finite, unitary, reflection group acting on the complex vector space V and X is a subspace of V. Define N to be the setwise stabilizer of X in W, Z to be the pointwise stabilizer, and C=N/Z. Then restriction defines a…
Representation theory of the symmetric group $\mathfrak{S}_n$ has a very distinctive combinatorial flavor. The conjugacy classes as well as the irreducible characters are indexed by integer partitions $\lambda \vdash n$. We introduce class…
We use the implicitization procedure to generate polynomial equality constraints on the set of distributions induced by local interventions on variables governed by a causal Bayesian network with hidden variables. We show how we may reduce…
This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associated matrix. Moreover, we present algorithms to compute more precise…
In this paper we generalize the classical Groebner basis technique to prove the existence and present a method of computation of a dimension polynomial in two variables associated with a finitely generated D-module, that is, a finitely…
Given a polynomial P of partial derivatives of the Kahler metric, expressed as a linear combination of directed multigraphs, we prove a simple criterion in terms of the coefficients for $P$ to be an invariant polynomial, i.e. invariant…
The weight systems of finite-dimensional representations of complex, simple Lie algebras exhibit patterns beyond Weyl-group symmetry. These patterns occur because weight systems can be decomposed into lattice polytopes in a natural way.…
It is common in stability analysis to linearize a system and investigate the spectrum of the Jacobian matrix. This approach faces the challenge of determining the matrix spectrum when the coefficients depend on parameters or when the…
Let (g,[p]) be a finite-dimensional restricted Lie algebra, defined over an algebraically closed field k of characteristic p>0. The scheme of tori of maximal dimension of g gives rise to a finite group S(g) that coincides with the Weyl…
Thom (residual) polynomials in characteristic classes are used in the analysis of geometry of functional spaces. They serve as a tool in description of classes Poincar\'e dual to subvarieties of functions of prescribed types. We give…
We describe algorithms for computing various functors for algebraic D-modules, i.e. systems of linear partial differential equations with polynomial coefficients. We will give algorithms for restriction, tensor product, localization, and…
Let k be an algebraically closed field of characteristic p>0. We compute the Weyl filtration multiplicities in indecomposable tilting modules and the decomposition numbers for the general linear group over k in terms of cap diagrams under…
We calculate the expectation value of an arbitrary product of characteristic polynomials of complex random matrices and their hermitian conjugates. Using the technique of orthogonal polynomials in the complex plane our result can be written…
A discussion of character formulae for positive energy unitary irreducible representations of the the conformal group is given, employing Verma modules and Weyl group reflections. Product formulae for various conformal group representations…
Formulas to calculate multivector exponentials in a base-free representation and in a orthonormal basis are presented for an arbitrary Clifford geometric algebra Cl(p,q). The formulas are based on the analysis of roots of characteristic…
It is known that characters of irreducible representations of finite Lie algebras can be obtained using theWeyl character formula including Weyl group summations which make actual calculations almost impossible except for a few Lie algebras…
In algebraic geometry, one studies the solutions to polynomial equations, or, equivalently, to linear partial differential equations with constant coefficients. These lecture notes address the more general case when the coefficients are…
We provide an index bound for character sums of polynomials over finite fields. This improves the Weil bound for high degree polynomials with small indices, as well as polynomials with large indices that are generated by cyclotomic mappings…
The Hilbert class polynomial has as roots the j-invariants of elliptic curves whose endomorphism ring is a given imaginary quadratic order. It can be used to compute elliptic curves over finite fields with a prescribed number of points.…
A polynomial triangle is an array whose inputs are the coefficients in integral powers of a polynomial. Although polynomial coefficients have appeared in several works, there is no systematic treatise on this topic. In this paper we plan to…