Related papers: Monomial integrals on the classical groups
In this paper we extend the idea of integration to generic algebras. In particular we concentrate over a class of algebras, that we will call self-conjugated, having the property of possessing equivalent right and left multiplication…
We examine the effect of numerical integration on the convergence of high order pyramidal finite element methods. Rational functions are indispensable to the construction of pyramidal interpolants so the conventional treatment of numerical…
In this paper, we announce results from our thesis, which studies for the first time the categorification of the theory of generalized permutohedra. The vector spaces in the categorification are tightly constrained by certain continuity…
The code equivalence problem is central in coding theory and cryptography. While classical invariants are effective for Hamming and rank metrics, the sum-rank metric, which unifies both, introduces new challenges. This paper introduces new…
In this research, the Bernoulli polynomials are introduced. The properties of these polynomials are employed to construct the operational matrices of integration together with the derivative and product. These properties are then utilized…
Using a tensorial approach, we show how to construct a one-one correspondence between pattern probabilities and edge parameters for any group-based model. This is a generalisation of the "Hadamard conjugation" and is equivalent to standard…
By using the properties of orthogonal polynomials, we present an exact unitary transformation that maps the Hamiltonian of a quantum system coupled linearly to a continuum of bosonic or fermionic modes to a Hamiltonian that describes a…
We give a criterion of integrality of an one-dimensional formal group law in terms of congruences satisfied by the coefficients of the canonical invariant differential. For an integral formal group law a p-adic analytic formula for the…
There is a commutative algebra of differential-difference operators, with two parameters, associated to any dihedral group with an even number of reflections. The intertwining operator relates this algebra to the algebra of partial…
We study the set of monomial ideals in a polynomial ring as an ordered set, with the ordering given by reverse inclusion. We give a short proof of the fact that every antichain of monomial ideals is finite. Then we investigate ordinal…
Consider the diagonal action of the special orthogonal group on the direct sum of a finite number of copies of the standard representation--the underlying field is assumed to be algebraically closed and of characteristic not equal to two.…
A partial Hadamard matrix $H\in M_{M\times N}(\mathbb C)$ is called of "classical type" if the associated quantum semigroup $G\subset\widetilde{S}_M^+$ is classical. In combinatorial terms, if $H_1,\ldots,H_M\in\mathbb T^N$ are the rows of…
Our aim is to find a general approach to the theory of classical solutions of the Garnier system in $n$-variables, ${\cal G}_n$, based on the Riemann-Hilbert problem and on the geometry of the space of isomonodromy deformations. Our…
We give a completely explicit formula for all harmonic maps of finite uniton number from a Riemann surface to the unitary group U(n) in any dimension, and so all harmonic maps from the 2-sphere, in terms of freely chosen meromorphic…
The algebras considered in this paper are commutative rings of which the additive group is a finite-dimensional vector space over the field of rational numbers. We present deterministic polynomial-time algorithms that, given such an…
In recent times, there has been a lot of active research on monomial groups in two different directions. While group theorists are interested in the study of their normal subgroups and Hall subgroups, the interest of group ring theorists…
Considering finite extensions K[A] \subseteq K[B] of positive affine semigroup rings over a field K we have developed in [1] an algorithm to decompose K[B] as a direct sum of monomial ideals in K[A]. By computing the regularity of…
This paper is our second step towards developing a theory of testing monomials in multivariate polynomials. The central question is to ask whether a polynomial represented by an arithmetic circuit has some types of monomials in its…
Classifier ensembles are pattern recognition structures composed of a set of classification algorithms (members), organized in a parallel way, and a combination method with the aim of increasing the classification accuracy of a…
The iterative method of Sinkhorn allows, starting from an arbitrary real matrix with non-negative entries, to find a so-called 'scaled matrix' which is doubly stochastic, i.e. a matrix with all entries in the interval (0, 1) and with all…