相关论文: Kasteleyn cokernels

In a previous article by two of the present authors and S. Bonzio, \L ukasiewicz near semirings were introduced and it was proven that basic algebras can be represented (precisely, are term equivalent to) as near semirings. In the same work…

We study certain bijection between plane partitions and $\mathbb{N}$-matrices. As applications, we prove a Cauchy-type identity for generalized dual Grothendieck polynomials. We introduce two statistics on plane partitions, whose generating…

We prove an asymptotic formula for the probability that, if one chooses a domino tiling of a large Aztec diamond at random according to the uniform distribution on such tilings, the tiling will contain a domino covering a given pair of…

This paper derives exponential tail bounds and polynomial moment inequalities for the spectral norm deviation of a random matrix from its mean value. The argument depends on a matrix extension of Stein's method of exchangeable pairs for…

In the study of determinant formulas for Schur functions, Hamel and Goulden introduced a class of Giambelli-type matrices with respect to outside decompositions of partition diagrams, which unify the Jacobi-Trudi matrices, the Giambelli…

A Euclidean oriented matroid program yields a partial ordering of the cocircuits of its cocircuit graph. We show that every linear extension of that ordering yields a topological sweep and induces a recursive atom-ordering (a shelling of…

The scale invariant Petrov classification of the Weyl tensor is linked to the scale invariant combination of the Kasner index constraints, and the Lifshitz-Khalatnikov Kasner index parametrization scheme turns out to be a natural way of…

We prove a normal form theorem for Poisson structures around Poisson transversals (also called cosymplectic submanifolds), which simultaneously generalizes Weinstein's symplectic neighborhood theorem from symplectic geometry and Weinstein's…

We study a class of observables in four-dimensional superconformal Yang--Mills theories which, in the planar limit at finite 't Hooft coupling, can be expressed as determinants of semi-infinite matrices built from Bessel functions. This…

We say that two graphs are similar if their adjacency matrices are similar matrices. We show that the square grid $G_n$ of order $n$ is similar to the disjoint union of two copies of the quartered Aztec diamond $QAD_{n-1}$ of order $n-1$…

This paper consists of three parts: (I) To develop general theory of a (large) class of central simple finite dimensional algebras and answering some natural questions about them (that in general situation it is not even clear how to…

We formulate a natural model of current loops and magnetic monopoles for arbitrary planar graphs, which we call the monopole-dimer model, and express the partition function of this model as a determinant. We then extend the method of…

In this paper we elaborate a general homotopy-theoretic framework in which to study problems of descent and completion and of their duals, codescent and cocompletion. Our approach to homotopic (co)descent and to derived (co)completion can…

This paper investigates the Smith normal form equivalence problem for multivariate polynomial matrices. Using methods from matrix theory and polynomial ideal theory, we prove that Frost and Storey's 1978 conjecture holds for a broad class…

We investigate isoperimetric upper bounds for sums of consecutive Steklov eigenvalues of planar domains. The normalization involves the perimeter and scale-invariant geometric factors which measure deviation of the domain from roundness. We…

We consider the problem of representing the Kac-Moody algebra $\mathfrak{g}(N)$ specified by an $r\times r$ indecomposable generalised Cartan matrix $N$ as vector fields on the torus ${{\bb C}^*}^r$. It is shown that, if the representations…

We study the regularity and the algebraic properties of certain lattice ideals. We establish a map I --> I\~ between the family of graded lattice ideals in an N-graded polynomial ring over a field K and the family of graded lattice ideals…

We discover new P-time computable six-vertex models on planar graphs beyond Kasteleyn's algorithm for counting planar perfect matchings. We further prove that there are no more: Together, they exhaust all P-time computable six-vertex models…

Schutzenberger's theorem for the ordinary RSK correspondence naturally extends to Chen et. al's correspondence for matchings and partitions. Thus the counting of bilaterally symmetric $k$-noncrossing partitions naturally arises as an…

Airy and Pearcey-like kernels and generalizations arising in random matrix theory are expressed as double integrals of ratios of exponentials, possibly multiplied with a rational function. In this work it is shown that such kernels are…