相关论文: Schur function identities and the number of perfec…
Rouch\'e's Theorem is among the most useful results in complex analysis for counting zeros of analytic functions. Rouch\'e's Theorem also admits a harmonic analogue for counting zeros of complex harmonic functions. Previously, this analogue…
We show how to compute the exact partition function for lattice statistical-mechanical models whose Boltzmann weights obey a special "crossing" symmetry. The crossing symmetry equates partition functions on different trivalent graphs,…
Given three natural numbers $k,l,d$ such that $k+l=d(d+3)/2$, the Zeuthen number $N_{d}(l)$ is the number of nonsingular complex algebraic curves of degree $d$ passing through $k$ points and tangent to $l$ lines in $\PP^2$. It does not…
In 1985, Chv\'{a}tal introduced the concept of star cutsets as a means to investigate the properties of perfect graphs, which inspired many researchers to study cutsets with some specific structures, for example, star cutsets, clique…
The Tangent Method of Colomo and Sportiello is applied to the study of the asymptotics of domino tilings of large Aztec rectangles, with some fixed distribution of defects along a boundary. The associated Non-Intersecting Lattice Path…
We say that a line in $\mathbb P^{n+1}_k$ is osculating to a hypersurface $Y$ if they meet with contact order $n+1$. When $k=\mathbb C$, it is known that through a fixed point of $Y$, there are exactly $n!$ of such lines. Under some parity…
The computation of short paths in graphs with arc lengths is a pillar of graph algorithmics and network science. In a more diverse world, however, not every short path is equally valuable. For the setting where each vertex is assigned to a…
As a continuation to our previous work [9, 10], we consider the domino tiling problem with impurities. (1) if we have more than two impurities on the boundary, we can compute the number of corresponding perfect matchings by using the…
We use the subgraph replacement method to investigate new properties of the tilings of regions on the square lattice with diagonals drawn in. In particular, we show that the centrally symmetric tilings of a generalization of the Aztec…
We consider the coincidence problem for the square lattice that is translated by an arbitrary vector. General results are obtained about the set of coincidence isometries and the coincidence site lattices of a shifted square lattice by…
Fairly shortly after the publication of the Aztec diamond theorem of Elkies, Kuperberg, Larsen and Propp in 1992, interest arose in finding the number of domino tilings of an Aztec diamond with an ``Aztec window,'' i.e.\ a hole in the shape…
We consider the expansion of the square of a complete homogeneous function $h_\lambda$, or of an elementary symmetric function $e_\lambda$, in the basis of Schur functions. This square also decomposes into two plethysms, $s_2[h_\lambda]$…
We discuss connection between the XXZ Heisenberg spin chain in the limiting case of zero anisotropy and some aspects of enumerative combinatorics. The representation of the Bethe wave functions via the Schur functions allows to apply the…
Computing the real solutions to a system of polynomial equations is a challenging problem, particularly verifying that all solutions have been computed. We describe an approach that combines numerical algebraic geometry and sums of squares…
We prove combinatorially that the parity of the number of domino tilings of a region is equal to the parity of the number of domino tilings of a particular subregion. Using this result we can resolve the holey square conjecture. We…
Two vectors in $\BZ^3$ are called \emph{twins} if they are orthogonal and have the same length. The paper describes twin pairs using cubic lattices, and counts the number of twin pairs with a given length. Integers $M$ with the property…
Let G be GL_N or SL_N as reductive linear algebraic group over a field k of positive characteristic p. We prove several results that were previously established only when N < 6 or p > 2^N. Let G act rationally on a finitely generated…
A new descent set statistic on involutions, defined geometrically via their interpretation as matchings, is introduced in this paper, and shown to be equi-distributed with the standard one. This concept is then applied to construct explicit…
A matching-cut of a graph is an edge cut that is a matching. The problem Matching-Cut is that of recognizing graphs with a matching-cut and is NP-complete, even if the graph belongs to one of a number of classes. We initiate the study of…
Proctor's work on staircase plane partitions yields an enumeration of lozenge tilings of a halved hexagon on the triangular lattice. Rohatgi later extended this tiling enumeration to a halved hexagon with a triangle cut off from the…