Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userInversion relations, reciprocity and polyominoes
58
0
0.0
(
0
)
Authors
M. Bousquet-Melou
Ask ChatGPT about the research
No Arabic abstract
We derive self-reciprocity properties for a number of polyomino generating functions, including several families of column-convex polygons, three-choice polygons and staircase polygons with a staircase hole. In so doing, we establish a connection between the reciprocity results known to combinatorialists and the inversion relations used by physicists to solve models in statistical mechanics. For several classes of convex polygons, the inversion (reciprocity) relation, augmented by certain symmetry and analyticity properties, completely determines the anisotropic perimeter generating function.
rate research
Read More
Polyominoes are a subset of polygons which can be constructed from integer-length squares fused at their edges. A system of polygons P is interlocked if no subset of the polygons in P can be removed arbitrarily far away from the rest. It is already known that polyominoes with four or fewer squares cannot interlock. It is also known that determining the interlockedness of polyominoes with an arbitrary number of squares is PSPACE hard. Here, we prove that a system of polyominoes with five or fewer squares cannot interlock, and that determining interlockedness of a system of polyominoes including hexominoes (polyominoes with six squares) or larger polyominoes is PSPACE hard.
In this paper, by means of the classical Lagrange inversion formula, we establish a general nonlinear inverse relations which is a partial solution to the problem proposed in the paper [J. Wang, Nonlinear inverse relations for the Bell polynomials via the Lagrange inversion formula, J. Integer Seq., Vol. 22 (2019), Article 19.3.8. (https://cs.uwaterloo.ca/journals/JIS/VOL22/Wang/wang53.pdf). As applications of this inverse relation, we not only find a short proof of another nonlinear inverse relation due to Birmajer et al., but also set up a few convolution identities concerning the Mina polynomials.
By analogy with linear-response we formulate the duality and reciprocity properties of current and voltage fluctuations expressed by Nyquist relations including the intrinsic bandwidths of the respective fluctuations. For this purpose we individuate total-number and drift-velocity fluctuations of carriers inside a conductor as the microscopic sources of noise. The spectral densities at low frequency of the current and voltage fluctuations and the respective conductance and resistance are related in a mutual exclusive way to the corresponding noise-source. The macroscopic variance of current and voltage fluctuations are found to display a dual property via a plasma conductance that admits a reciprocal plasma resistance. Analogously, the microscopic noise-sources are found to obey a dual property and a reciprocity relation. The formulation is carried out in the frame of the grand canonical (for current noise) and canonical (for voltage noise) ensembles and results are derived which are valid for classical as well as for degenerate statistics including fractional exclusion statistics. The unifying theory so developed sheds new light on the microscopic interpretation of dissipation and fluctuation phenomena in conductors. In particular it is proven that, as a consequence of the Pauli principle, for Fermions non-vanishing single-carrier velocity fluctuations at zero temperature are responsible for diffusion but not for current noise, which vanishes in this limit.
The Euler characteristic of a semialgebraic set can be considered as a generalization of the cardinality of a finite set. An advantage of semialgebraic sets is that we can define negative sets to be the sets with negative Euler characteristics. Applying this idea to posets, we introduce the notion of semialgebraic posets. Using negative posets, we establish Stanleys reciprocity theorems for order polynomials at the level of Euler characteristics. We also formulate the Euler characteristic reciprocities for chromatic and flow polynomials.
The theme of this article is a reciprocity between bounded up-down paths and bounded alternating sequences. Roughly speaking, this ``reciprocity manifests itself by the fact that the extension of the sequence of numbers of paths of length $n$, consisting of diagonal up- and down-steps and being confined to a strip of bounded width, to negative $n$ produces numbers of alternating sequences of integers that are bounded from below and from above. We show that this reciprocity extends to families of non-intersecting bounded up-down paths and certain arrays of alternating sequences which we call alternating tableaux. We provide as well weight
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
