相关论文: Replacing Pfaffians and applications

We derive a collection of identities for bivariate Fibonacci and Lucas polynomials using essentially a matrix approach as well as properties of such polynomials when the variables $x$ and $y$ are replaced by polynomials. A wealth of…

The paper aims to initiate a systematic study of conformal mappings between Finsler spacetimes and, more generally, between pseudo-Finsler spaces. This is done by extending several results in pseudo-Riemannian geometry which are necessary…

Word-representable graphs, which are the same as semi-transitively orientable graphs, generalize several fundamental classes of graphs. In this paper we propose a novel approach to study word-representability of graphs using a technique of…

We give a correspondence between graphs with a given degree sequence and fillings of Ferrers diagrams by nonnegative integers with prescribed row and column sums. In this setting, k-crossings and k-nestings of the graph become occurrences…

For every family of orthogonal polynomials, we define a new realization of the Yangian of ${\mathfrak{gl}}_n$. Except in the case of Dickson polynomials, the new realizations do not satisfy the RTT relation. We obtain an analogue of the…

In the previous paper (J. Combin. Theory Ser. A, 120, 2013, 1263--1284) H. Tagawa and the two authors proposed an algebraic method to compute certain Pfaffians whose form resemble to Hankel determinants associated with moment sequences of…

We study the graphs formed from instances of the stable matching problem by connecting pairs of elements with an edge when there exists a stable matching in which they are matched. Our results include the NP-completeness of recognizing…

Let A^2 be the affine plane over a field K of characteristic 0. Birational morphisms of A^2 are mappings A^2 \to A^2 given by polynomial mappings \phi of the polynomial algebra K[x,y] such that for the quotient fields, one has K(\phi(x),…

Given an associative multiplication in matrix algebra compatible with the usual one or, in other words, linear deformation of matrix algebra, we construct a solution to the classical Yang-Baxter equation. We also develop a theory of such…

We give new identities for some symmetric polynomials. As applications of these identities, we obtain some formulas for a higher order analogue of Fibonacci and Lucas numbers.

We examine the structure of Farey maps, which are a class of maps (graph embeddings on surfaces) that have received significant attention recently. We describe how they are related to each other through regular coverings and parallel…

In this note we present a method for obtaining a wide class of combinatorial identities. We give several examples, in particular, based on the Gamma and Beta functions. Some of them have already been considered by previously, and other are…

The word problem for an arbitrary associative Rota-Baxter algebra is solved. This leads to a noncommutative generalization of the classical Spitzer identities. Links to other combinatorial aspects, particularly of interest in physics, are…

All ten symmetry classes of plane partitions that fit in a given box are known to be enumerated by simple product formulas, but there is still no unified proof for all of them. Progress towards this goal can be made by establishing…

We study which groups with pairing can occur as the Jacobian of a finite graph. We provide explicit constructions of graphs whose Jacobian realizes a large fraction of odd groups with a given pairing. Conditional on the generalized Riemann…

This paper presents an alternative approach to simplify the proofs of some important results related to polynomial mappings in Computational Algebraic Geometry such as Polynomial Implicitization, Image Closure and some properties of the…

The initial purpose of this paper is to provide a combinatorial proof of the minor summation formula of Pfaffians based on the lattice path method. There we related Pl\"ucker relations with the minor summation formula of Pfaffians to…

Determining whether two graphs are structurally identical is a fundamental problem with applications spanning mathematics, computer science, chemistry, and network science. Despite decades of study, graph isomorphism remains a challenging…

The cutting equations are diagrammatic identities that are used to prove perturbative unitarity in quantum field theory. In this paper, we derive algebraic, upgraded versions of them. Differently from the diagrammatic versions, the…

We construct homeomorphisms of compacta from relations between finite graphs representing their open covers. Applied to the pseudoarc, this yields simple Fra\"iss\'e theoretic proofs of several important results, both old and new.…