Related papers: Complexity and Completeness of Immanants
We give a high precision polynomial-time approximation scheme for the supremum of any honest n-variate (n+2)-nomial with a constant term, allowing real exponents as well as real coefficients. Our complexity bounds count field operations and…
A set $S\subseteq V$ of a graph $G=(V,E)$ is a dominating set if each vertex has a neighbor in $S$ or belongs to $S$. Dominating Set is the problem of deciding, given a graph $G$ and an integer $k\geq 1$, if $G$ has a dominating set of size…
Let $S = \mathbb{C}[x_{i,j}]$ be the ring of polynomial functions on the space of $m \times n$ matrices, and consider the action of the group $\mathbf{GL} = \mathbf{GL}_m \times \mathbf{GL}_n$ via row and column operations on the matrix…
Consider the Wronskians of the classical Hermite polynomials $$H_{\lambda, l}(x):=\mathrm{Wr}(H_l(x),H_{k_1}(x),\ldots, H_{k_n}(x)), \quad l \in \mathbb Z_{\geq 0},$$ where $k_i=\lambda_i+n-i, \,\, i=1,\dots, n$ and $\lambda=(\lambda_1,…
The set of functions parameterized by a linear fully-connected neural network is a determinantal variety. We investigate the subvariety of functions that are equivariant or invariant under the action of a permutation group. Examples of such…
For a fixed Feynman graph one can consider Feynman integrals with all possible powers of propagators and try to reduce them, by linear relations, to a finite subset of integrals, the so-called master integrals. Up to now, there are numerous…
Starting with the zero-square "zeon algebra" the connection with permanents is shown. Permanents of sub-matrices of a linear combination of the identity matrix and all-ones matrix leads to moment polynomials with respect to the exponential…
Pfaffians of matrices with entries z[i,j]/(x\_i+x\_j), or determinants of matrices with entries z[i,j]/(x\_i-x\_j), where the antisymmetrical indeterminates z[i,j] satisfy the Pl\"ucker relations, can be identified with a trace in an…
For some monoids, we give a method of composing invertibility preserving maps associated to "partial involutions." Also, we define the notion of "determinants for finite dimensional algebras over a field." As examples, we give invertibility…
By generalizing Frobenius' polynomial method to good partition algebra, we will develop new character theories for a finite group $G$. A uniform defining equations are derived for these kinds of character theories. The new character…
Determinantal and permanental processes are point processes with a correlation function given by a determinant or a permanent. Their atoms exhibit mutual attraction of repulsion, thus these processes are very far from the uncorrelated…
The emptiness and containment problems for probabilistic automata are natural quantitative generalisations of the classical language emptiness and inclusion problems for Boolean automata. It is well known that both problems are undecidable.…
We give a combinatorial interpretation of the determinant of a matrix as a generating function over Brauer diagrams in two different but related ways. The sign of a permutation associated to its number of inversions in the Leibniz formula…
Integration By Parts (IBP) is an important method for computing Feynman integrals. This work describes a formulation of the theory involving a set of differential equations in parameter space, and especially the definition and study of an…
In this paper first we give a partial answer to a question of L. Moln\'ar and W. Timmermann. Namely, we will describe those linear (not necessarily bijective) transformations on the set of self-adjoint matrices which preserve a unitarily…
In this paper we continue studying of matrix $n\times n$ linear differential intertwining operators. The problems of minimization and of reducibility of matrix intertwining operators are considered and criterions of weak minimizability and…
In the fundamental Stable Marriage and Stable Roommates problems, there are inherent trade-offs between the size and stability of solutions. While in the former problem, a stable matching always exists and can be found efficiently using the…
We summarize the recent results about complete solvability of Hermitian and rectangular complex matrix models. Partition functions have very simple character expansions with coefficients made from dimensions of representation of the linear…
Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…
We extend some of the results of Agler, Knese, and McCarthy [1] to $n$-tuples of commuting isometries for $n>2$. Let $\mathbb{V}=(V_1,\dots,V_n)$ be an $n$-tuple of a commuting isometries on a Hilbert space and let Ann$(\mathbb{V})$ denote…