Related papers: Monomial integrals on the classical groups
Polynomial optimization problems over binary variables can be expressed as integer programs using a linearization with extra monomials in addition to those arising in the given polynomial. We characterize when such a linearization yields an…
In this paper we will show that monomial summability can be characterized using Borel-Laplace like integral transformations depending of a parameter $0<s<1$. We will apply this result to prove 1-summability in a monomial of formal solutions…
The first half of this paper is largely expository, wherein we present a systematic combinatorial approach to the theory of polynomial (semi)invariants and multilinear invariants of several vectors and covectors, for the classical groups.…
The algebraic diversity framework generalizes temporal averaging over multiple observations to algebraic group action on a single observation for second-order statistical estimation. The central open problem in this framework is…
We study a class of matrices with noncommutative entries, which were first considered by Yu. I. Manin in 1988 in relation with quantum group theory. They are defined as "noncommutative endomorphisms" of a polynomial algebra. More explicitly…
The present work is inspired by three interrelated themes: Weingarten calculus for integration over unitary groups, monotone Hurwitz numbers which enumerate certain factorisations of permutations into transpositions, and Jucys-Murphy…
We study a new biholomorphic invariant of holomorphic maps between domains in different dimensions based on generic initial ideals. We start with the standard generic monomial ideals to find invariants for rational maps of spheres and…
We study the rotational structures of aperiodic tilings in Euclidean space of arbitrary dimension using topological methods. Classical topological approaches to the study of aperiodic patterns have largely concentrated just on translational…
We axiomatize and study the matrices of type $H\in M_N(A)$, having unitary entries, $H_{ij}\in U(A)$, and whose rows and columns are subject to orthogonality type conditions. Here $A$ can be any $C^*$-algebra, for instance $A=\mathbb C$,…
We study numerical invariants associated with the reduction of singularities of holomorphic foliation germs on $(\mathbb{C}^2, 0)$. Building on our previous work on generalized curve foliations, we extend explicit formulas for several…
We present a unified theory for formal mathematical systems including recursive systems closely related to formal grammars, including the predicate calculus as well as a formal induction principle. We introduce recursive systems generating…
The present work develops a framework to derive piecewise polynomial measures arising from invariant measures on adjoint orbits in the context of compact and semisimple Lie groups. These measures are computed from orbital integrals via…
This paper introduces a canonical Polish groupoid associated to any separable unital C*-algebra, termed the unitary conjugation groupoid. It is defined as the semidirect product of the algebra's dual space by its unitary group, acting by…
A general theory of vector-valued modular functions, holomorphic in the upper half-plane, is presented for finite dimensional representations of the modular group. This also provides a description of vector-valued modular forms of arbitrary…
We present a systematic method for determining the two-loop effective Lagrangian resulting from integrating out a set of heavy particles in an ultraviolet scalar theory. We prove that the matching coefficients are entirely determined from…
Nowadays integration of mass matrix components in the element domain is performed using various numerical integration schemes, each one possess different level of accuracy, alters in number of integration (Gauss) points and requires…
Two isometry groups of combinatorial codes are described: the group of automorphisms and the group of monomial automorphisms, which is the group of those automorphisms that extend to monomial maps. Unlike the case of classical linear codes,…
We define a categorical framework in which we build a systematic construction that provides generic invariants for C*-algebras. The benefit is significant as we show that any invariant arising this way automatically enjoys nice properties…
Graphs and various graph-like combinatorial structures, such as preorders and hypergraphs, are ubiquitous in programming. This paper focuses on representing graphs in a purely functional programming language like Haskell. There are several…
Undirected graphs are frequently used to model networks. The topology of an undirected graph G can be captured by an adjacency matrix; this matrix in turn can be visualized directly to give insight into the graph structure. Which visual…