# Tagged Questions

**11**

votes

**0**answers

372 views

### Is this graph polynomial known? Can it be efficiently computed?

I am a physicist, so apologies in advance for any confusing notation or terminology; I'll happily clarify. To provide a minimal amount of context, the following graph polynomial came up in my research ...

**3**

votes

**0**answers

131 views

### Kasteleyn, Gessel-Viennot and eigenvalues

The Kasteleyn matrix (for counting perfect matchings) and the LindstrÃ¶m-Gessel-Viennot matrix (for counting families of nonintersecting lattice paths) are tightly related, as observed many times by ...

**8**

votes

**1**answer

262 views

### computing average height-functions for lozenge tilings

Can anyone suggest a simple and efficient way (preferably embodied in computer code) to compute the average height function for lozenge tilings of an $a,b,c,a,b,c$ semiregular hexagon? I prefer to ...

**13**

votes

**1**answer

415 views

### Arctic regions in higher dimensional zonotopes

Same way as the two dimensional tilings by rhombi come from minimal surfaces in a $D$ dimensional cubical lattice as mentioned in this answer, one can consider higher dimensional zonotopes tiled by ...

**11**

votes

**3**answers

529 views

### Exponential bounds for the number of lattice animals with a given boundary.

Hi all,
I am doing a work in collaboration with other mathematicians about phase transition in the Ising model and we need to know if exponential upper bounds exist for the number of lattice animals ...

**2**

votes

**3**answers

741 views

### Maximal clique intersection graphs

Consider graph $T$ where nodes correspond to maximal cliques of some graph $G$ and two nodes can be connected if corresponding cliques intersect. Clique tree is an example when $T$ is required to be a ...

**2**

votes

**0**answers

270 views

### Self-avoiding Walk with next-nearest neighbors

Background
I study polymer physics and am doing experiments testing the model outlined in this paper. Basically, the polymers fall into an integer number of pits, and we create a partition function ...

**4**

votes

**1**answer

198 views

### Connective constant for self-avoiding walks on a skip-chain

Suppose we have an undirected graph with integer valued nodes where $0<|i-j|\le 2$ implies nodes $i$ and $j$ are connected. Let $c_n$ be the number of self-avoiding walks on this graph of length ...

**13**

votes

**4**answers

790 views

### Pennies on a carpet problem

I recently read the following "open problem" titled "Pennies on a carpet" in "An Introduction To Probability and Random Processes" by Baclawski and Rota (page viii of book, page 10 of following ...

**12**

votes

**2**answers

1k views

### What (if anything) happened to Viennot's theory of Heaps of pieces?

In 1986 G.X. Viennot published "Heaps of pieces, I : Basic definitions and combinatorial lemmas" where he developed the theory of heaps of pieces, from the abstract: a geometric interpretation of ...