相关论文: Complexity and Completeness of Immanants
This thesis is divided into two parts. In the first part we study completely integrable systems, and their underlying structures, in detail. We study their deformation theory and the different equivalence relations surrounding it. We…
Although NP-Complete problems are the most difficult decisional problems, it is possible to discover in them polynomial (or easy) observables. We study the Graph Partitioning Problem showing that it is possible to recognize in it two…
A new family of asymmetric matrices of Walsh-Hadamard type is introduced. We study their properties and, in particular, compute their determinants and discuss their eigenvalues. The invertibility of these matrices implies that certain…
Classical (maximal) superintegrable systems in $n$ dimensions are Hamiltonian systems with $2n-1$ independent constants of the motion, globally defined, the maximum number possible. They are very special because they can be solved…
A new class of structured matrices is presented and a closed form formula for their determinant is established. This formula has strong connections with the one for Vandermonde matrices.
We prove almost sure strong asymptotic freeness of i.i.d. random unitaries with the following law: sample a Haar unitary matrix of dimension $n$ and then send this unitary into an irreducible representation of $U(n)$. The strong convergence…
A set $S \subseteq V$ is a dominating set in G if for every u \in V \ S, there exists $v \in S$ such that $(u,v) \in E$, i.e., $N[S] = V$. A dominating set $S$ is an Isolate Dominating Set} (IDS) if the induced subgraph $G[S]$ has at least…
Given a graphical model, one essential problem is MAP inference, that is, finding the most likely configuration of states according to the model. Although this problem is NP-hard, large instances can be solved in practice. A major open…
We consider maps between commutative groups and their functional degrees. These degrees are defined based on a simple idea -- the functional degree should decrease if a discrete derivative is taken. We show that the maps of finite…
The paper develops elementary linear algebra methods to compute the determinants of the tensor symmetrizations of quadratic and hermitian forms over fields of good characteristic. Explicit results are given for the partitions $(n)$,…
We prove an identity relating the permanent of a rank $2$ matrix and the determinants of its Hadamard powers. When viewed in the right way, the resulting formula looks strikingly similar to an identity of Carlitz and Levine, suggesting the…
Let $A$ be a ring with $1\neq 0$, not necessarily finite, endowed with an involution~$*$, that is, an anti-automorphism of order $\leq 2$. Let $H_n(A)$ be the additive group of all $n\times n$ hermitian matrices over $A$ relative to $*$.…
Barvinok introduced the symmetrized determinant ($\sdet$) as a \emph{non-commutative} analogue of the determinant. Intuitively, given a square matrix over an associative algebra, we can obtain the symmetrized determinant by averaging over…
An integer sequence that is defined by initial values and a linear recurrence with constant integer coefficients, can be represented by the difference of two arithmetic terms containing exponentiation. All constants occuring in the term are…
Multiplicative invariance is a well-studied property of subsets of the unit interval. The theory in the complex plane is less developed. This paper introduces an analogous definition for multiplicative invariance in the complex plane…
A persistence module with $m$ discrete parameters is a diagram of vector spaces indexed by the poset $\mathbb{N}^m$. If we are only interested in the large scale behavior of such a diagram, then we can consider two diagrams equivalent if…
This is the last in a series of papers where we prove a conjecture of Deser and Schwimmer regarding the algebraic structure of ``global conformal invariants''; these are defined to be conformally invariant integrals of geometric scalars.…
Given a system of n homogeneous polynomials in n variables which is equivariant with respect to the canonical actions of the symmetric group of n symbols on the variables and on the polynomials, it is proved that its resultant can be…
We study general quantum integrable Hamiltonians linear in a coupling constant and represented by finite NxN real symmetric matrices. The restriction on the coupling dependence leads to a natural notion of nontrivial integrals of motion and…
A dominating set of a graph is a set of vertices such that every vertex not in the set has at least one neighbor in the set. The problem of counting dominating sets is #P-complete for chordal graphs but solvable in polynomial time for its…