Related papers: Determinants from homomorphisms
The major challenge in designing a discriminative learning algorithm for predicting structured data is to address the computational issues arising from the exponential size of the output space. Existing algorithms make different assumptions…
We evaluate four families of determinants of matrices, where the entries are sums or differences of generating functions for paths consisting of up-steps, down-steps and level steps. By specialisation, these determinant evaluations have…
The study of homological invariants such as Tor, Ext and local cohomology modules constitutes an important direction in commutative algebra. Explicit descriptions of these invariants are notoriously difficult to find and often involve…
We extend the notion of 'homomorphism-homogeneity' to a wider class of kinds of maps than previously studied, and we investigate the relations between the resulting notions of homomorphism-homogeneity, giving several examples. We also give…
We construct biorthogonal polynomials for a measure over the complex plane which consists in the exponential of a potential V(z,z*) and in a set of external sources at the numerator and at the denominator. We use the pseudonorm of these…
Polynomial algebra offers a standard approach to handle several problems in geometric modeling. A key tool is the discriminant of a univariate polynomial, or of a well-constrained system of polynomial equations, which expresses the…
This paper investigates causal influences between agents linked by a social graph and interacting over time. In particular, the work examines the dynamics of social learning models and distributed decision-making protocols, and derives…
In the setting of polynomial jump-diffusion dynamics, we provide an explicit formula for computing correlators, namely, cross-moments of the process at different time points along its path. The formula appears as a linear combination of…
The notion of homomorphism indistinguishability offers a combinatorial framework for characterizing equivalence relations of graphs, in particular equivalences in counting logics within finite model theory. That is, for certain graph…
In this paper, a relationship between the determinant of an alternating link and a certain polytope obtained from the link diagram is analyzed. We also show that when the underlying graph of the link diagram is properly oriented, the number…
The problem of writing real zero polynomials as determinants of linear matrix polynomials has recently attracted a lot of attention. Helton and Vinnikov have proved that any real zero polynomial in two variables has a determinantal…
We follow a stream of the history of positive matrices and positive functionals, as applied to algebraic sums of squares decompositions, with emphasis on the interaction between classical moment problems, function theory of one or several…
The goal of this paper is to present an algebraic approach to the basic results of the theory of linear recurrence relations. This approach is based on the ideas from the theory of representations of one endomorphisms (a special case of…
We calculate the autocorrelation functions (or shifted moments) of the characteristic polynomials of matrices drawn uniformly with respect to Haar measure from the groups U(N), O(2N) and USp(2N). In each case the result can be expressed in…
Graph polynomials are graph parameters invariant under graph isomorphisms which take values in a polynomial ring with a fixed finite number of indeterminates. We study graph polynomials from a model theoretic point of view. In this paper we…
The cyclotomic matrix is commonly used to arrange cyclotomic numbers in a convenient format. A natural question is whether the structure of the matrix can reflect properties of these numbers. In this article, we examine cyclotomic numbers…
We study the homomorphism induced in homology by a closed correspondence between topological spaces, using projections from the graph of the correspondence to its domain and codomain. We provide assumptions under which the homomorphism…
We show that several orbital equations and orbital clusters of the quadratic (logistic) map coincide surprisingly with cyclotomic {\it period equations}, polynomials whose roots are Gaussian periods. An analytical expression for the field…
We establish a bijection between the set of finite topological $T_0$-spaces (or partially ordered sets) and equivalence classes of square matrices. The absolute value of the determinant or the rank of these matrices serve as simple homotopy…
Holographic algorithms introduced by Valiant are composed of two ingredients: matchgates, which are gadgets realizing local constraint functions by weighted planar perfect matchings, and holographic reductions, which show equivalences among…