Related papers: Isotropic systems and the interlace polynomial
Starting from de la Vall\'ee Poussin type (VP) interpolation, the authors have recently introduced a family of interpolating polynomial scaling and wavelet bases generating the approximation and detail spaces of a non-standard…
We fulfill the rough topological analysis of the problem of the motion of the Kovalevskaya top in a double field. This problem is described by a completely integrable system with three degrees of freedom not reducible to a family of systems…
Feasible interpolation is a general technique for proving proof complexity lower bounds. The monotone version of the technique converts, in its basic variant, lower bounds for monotone Boolean circuits separating two NP-sets to proof…
This paper is devoted to revealing the relationship between matrix-valued $\theta$-deformed bi-orthogonal polynomials and non-commutative Toda-type hierarchies. In this procedure, Wronski quasi-determinants are widely used and play the role…
We introduce an arithmetic version of the multivariate Tutte polynomial, and (for representable arithmetic matroids) a quasi-polynomial that interpolates between the two. A generalized Fortuin-Kasteleyn representation with applications to…
A method for finding Puiseux series goes back to Isaac Newton, which gives the terms of Puiseux series through an infinite recursive process; an additional argument is then used to show that the resulting Puiseux series are convergent. This…
Many graph polynomials, such as the Tutte polynomial, the interlace polynomial and the matching polynomial, have both a recursive definition and a defining subset expansion formula. In this paper we present a general, logic-based framework…
A fourientation of a graph is a choice for each edge of the graph whether to orient that edge in either direction, leave it unoriented, or biorient it. Fixing a total order on the edges and a reference orientation of the graph, we…
We find an algorithmic procedure that enables to compute and to describe the structure of the isotropy subgroups of the group of complex orthogonal matrices with respect to the action of similarity on complex symmetric matrices. A key step…
We define and study an integral refinement of the inverse of the Bloch-Kato exponential map which we call the de Rham logarithm. Our main tool to analyze the de Rham logarithm is the syntomic logarithm, a certain limit construction based on…
In the literature can be found several descriptions of the Tutte polynomial of graphs. Tutte defined it thanks to a notion of activity based on an ordering of the edges. Thereafter, Bernardi gave a non-equivalent notion of the activity…
Tutte paths are one of the most successful tools for attacking Hamiltonicity problems in planar graphs. Unfortunately, results based on them are non-constructive, as their proofs inherently use an induction on overlapping subgraphs and…
We introduce a new method to generate duality relations for correlation functions of the Potts model on planar graphs. The method extends previously known results, by allowing the consideration of the correlation function for arbitrarily…
By using the metric projection onto a closed self-dual cone of the Euclidean space, M. S. Gowda, R. Sznajder and J. Tao have defined generalized lattice operations, which in the particular case of the nonnegative orthant of a Cartesian…
We propose a protocol to demonstrate the topological order of a spin-1/2 lattice model with four-body interactions. Unlike other proposals, it does not rely on the controlled movement of quasiparticles, thus eliminating the addressing,…
There is a concept in linear algebra called a tridiagonal pair. The concept was motivated by the theory of $Q$-polynomial distance-regular graphs. We give a tutorial introduction to tridiagonal pairs, working with a special case as a…
A polynomial matrix inequality is a formula asserting that a polynomial matrix is positive semidefinite. Polynomial matrix optimization concerns minimizing the smallest eigenvalue of a symmetric polynomial matrix subject to a tuple of…
In two seminal papers Kontsevich used a construction called_graph homology_ as a bridge between certain infinite dimensional Lie algebras and various topological objects, including moduli spaces of curves, the group of outer automorphisms…
We study a class of integrable nonhomogeneous Lotka-Volterra systems whose quadratic terms are defined by an antisymmetric matrix and whose linear terms consist of three blocks. We provide the Poisson algebra of their Darboux polynomials,…
In this paper we give a new proof of the universality of the Tutte polynomial for matroids. This proof uses appropriate characters of Hopf algebra of matroids, algebra introduced by Schmitt (1994). We show that these Hopf algebra characters…