English
Related papers

Related papers: Isotropic systems and the interlace polynomial

200 papers

We give upper and lower bounds on the power of subsystems of the Ideal Proof System (IPS), the algebraic proof system recently proposed by Grochow and Pitassi, where the circuits comprising the proof come from various restricted algebraic…

Computational Complexity · Computer Science 2016-06-17 Michael A. Forbes , Amir Shpilka , Iddo Tzameret , Avi Wigderson

The Tutte polynomial is the most general invariant of matroids and graphs that can be computed recursively by deleting and contracting edges. We generalize this invariant to any class of combinatorial objects with deletion and contraction…

Combinatorics · Mathematics 2019-02-04 Clément Dupont , Alex Fink , Luca Moci

We consider the Ideal Proof System (IPS) introduced by Grochow and Pitassi and pose the question of which tautologies admit symmetric proofs, and of what complexity. The symmetry requirement in proofs is inspired by recent work establishing…

Logic in Computer Science · Computer Science 2025-04-24 Anuj Dawar , Erich Grädel , Leon Kullmann , Benedikt Pago

We prove the complete monotonicity on $(0,\infty)^n$ for suitable inverse powers of the spanning-tree polynomials of graphs and, more generally, of the basis generating polynomials of certain classes of matroids. This generalizes a result…

Combinatorics · Mathematics 2014-12-04 Alexander D. Scott , Alan D. Sokal

In [18] Fournier and Printems establish a methodology which allows to prove the absolute continuity of the law of the solution of some stochastic equations with H\"{o}lder continuous coefficients. This is of course out of reach by using…

Probability · Mathematics 2017-04-03 V. Bally , L. Caramellino

We introduce a binary matroid M(IAS(G)) associated with a looped simple graph G. M(IAS(G)) classifies G up to local equivalence, and determines the delta-matroid and isotropic system associated with G. Moreover, a parametrized form of its…

Combinatorics · Mathematics 2014-11-11 Lorenzo Traldi

The well known Liouville-Arnold theorem says that if a level surface of integrals of an integrable system is compact and connected, then it is a torus. However, in some important examples of integrable systems the topology of a level…

Mathematical Physics · Physics 2009-11-13 Alexei V. Penskoi

We construct new families of discrete vector orthogonal polynomials that have the property to be eigenfunctions of some difference operator. They are extensions of Charlier, Meixner and Kravchuk polynomial systems. The ideas behind our…

Classical Analysis and ODEs · Mathematics 2016-02-19 Emil Horozov

Recently V. Krushkal and D. Renardy generalized the Tutte polynomial from graphs to cell complexes. We show that evaluating this polynomial at the origin gives the number of cellular spanning trees in the sense of A. Duval, C. Klivans, and…

Combinatorics · Mathematics 2013-12-17 Carlos Bajo , Bradley Burdick , Sergei Chmutov

Moir\'e superlattices have emerged as a versatile platform for exploring a wide range of ex- otic quantum phenomena. Unlike angstrom-scale materials, the moir\'e length-scale system contains a large number of atoms, and its electronic…

Materials Science · Physics 2025-11-10 Xueheng Kuang , Federico Escudero , Pierre A. Pantaleón , Francisco Guinea , Zhen Zhan

An ordering for Laurent polynomials in the algebraic torus $(\mathbb C^*)^D$, inspired by the Cantero-Moral-Vel\'azquez approach to orthogonal Laurent polynomials in the unit circle, leads to the construction of a moment matrix for a given…

Classical Analysis and ODEs · Mathematics 2015-07-01 Gerardo Ariznabarreta , Manuel Mañas

We construct a new polynomial invariant of maps (graphs embedded in a compact surface, orientable or non-orientable), which contains as specializations the Krushkal polynomial, the Bollob\'as--Riordan polynomial, the Las Vergnas polynomial,…

Combinatorics · Mathematics 2018-04-05 Andrew Goodall , Bart Litjens , Guus Regts , Lluís Vena

Tutte's dichromate T(x,y) is a well known graph invariant. Using the original definition in terms of internal and external activities as our point of departure, we generalize the valuations T(x,1) and T(1,y) to hypergraphs. In the…

Combinatorics · Mathematics 2011-03-08 Tamás Kálmán

The Tutte polynomial of a graph is a two-variable polynomial whose zeros and evaluations encode many interesting properties of the graph. In this article we investigate the zeros of the Tutte polynomials of graphs, and show that they form a…

Combinatorics · Mathematics 2016-09-01 Seongmin Ok , Thomas J. Perrett

We investigate the local integrability and linearizability of a family of three-dimensional polynomial systems with the matrix of the linear approximation having the eigenvalues $1, \zeta, \zeta^2 $, where $\zeta$ is a primitive cubic root…

Dynamical Systems · Mathematics 2024-07-31 Bo Huang , Ivan Mastev , Valery Romanovski

In this note we generalize the convolution formula for the Tutte polynomial of Kook-Reiner-Stanton and Etienne-Las Vergnas to a more general setting that includes both arithmetic matroids and delta-matroids. As corollaries, we obtain new…

Combinatorics · Mathematics 2017-04-24 Spencer Backman , Matthias Lenz

We define totally-isotropic polynomials of alternating matrix spaces over finite fields, by analogy with independence polynomials of graphs. Our main result shows that totally-isotropic polynomials of graphical alternating matrix spaces…

Combinatorics · Mathematics 2024-08-20 Youming Qiao

In this work, a new approach has been developed to obtain numerical solution of linear Volterra type integral equations by obtaining asymptotic approximation to solutions. Using the classical Bernoulli polynomials, a set of orthonormal…

Numerical Analysis · Mathematics 2020-07-22 Udaya Pratap Singh

The Tutte polynomial is a crucial invariant of matroids. The polymatroid Tutte polynomial $\mathscr{T}_{P}(x,y)$, introduced by Bernardi et al., is an extension of the classical Tutte polynomial from matroids to polymatroids $P$. In this…

Combinatorics · Mathematics 2023-09-26 Xiaxia Guan , Xian'an Jin , Tamás Kálmán

We introduce a polynomial invariant of graphs on surfaces, $P_G$, generalizing the classical Tutte polynomial. Topological duality on surfaces gives rise to a natural duality result for $P_G$, analogous to the duality for the Tutte…

Combinatorics · Mathematics 2015-03-13 Vyacheslav Krushkal