Related papers: Staircases in Z^2
A periodic lattice in Euclidean space is the infinite set of all integer linear combinations of basis vectors. Any lattice can be generated by infinitely many different bases. This ambiguity was only partially resolved, but standard…
We consider staircase polygons, counted by perimeter and sums of k-th powers of their diagonal lengths, k being a positive integer. We derive limit distributions for these parameters in the limit of large perimeter and compare the results…
A circular Pascal array is a periodization of the familiar Pascal's triangle. Using simple operators defined on periodic sequences, we find a direct relationship between the ranges of the circular Pascal arrays and numbers of certain…
This paper continues the investigation of staircases in the family of Hirzebruch surfaces formed by blowing up the projective plane with weight b, that was started in Bertozzi, Holm et al. in arXiv:2010.08567. We explain the symmetries…
A bargraph is a self-avoiding lattice path with steps $U=(0,1)$, $H=(1,0)$ and $D=(0,-1)$ that starts at the origin and ends on the $x$-axis, and stays strictly above the $x$-axis everywhere except at the endpoints. Bargraphs have been…
The doorways problem considers adjacent parallel hallways of unit width each with a single doorway (aligned with integer lattice points) of unit width. It then asks, what are the properties of lines that pass through each doorway?…
We enumerate smooth and rationally smooth Schubert varieties in the classical finite types A, B, C, and D, extending Haiman's enumeration for type A. To do this enumeration, we introduce a notion of staircase diagrams on a graph. These…
We show, in full generality, that the staircase method provides integrals for mappings, and correspondences, obtained as traveling wave reductions of (systems of) integrable partial difference equations. We apply the staircase method to a…
In this note we discuss explicitly the structure of two simple set of zeros which are associated with the mean staircase emerging from the zeta function and we specify a solution using the Lambert W function. The argument of it may then be…
For a real number $x$, call $\frac1n \lfloor nx \rfloor$ the $n$-th lower rational approximation of $x$. We study the functions defined by taking the cumulative average of the first $n$ lower rational approximations of $x$, which we call…
Rational homology ellipsoids are certain Liouville domains diffeomorphic to rational homology balls and having Lagrangian pin-wheels as their skeleta. From the point of view of almost toric fibrations, they are a natural generalisation of…
The straight-line flow on almost every staircase and on almost every square tiled staircase is recurrent. For almost every square tiled staircase the set of periodic orbits is dense in the phase space.
We consider a new kind of straight and shifted plane partitions/Young tableaux --- ones whose diagrams are no longer of partition shape, but rather Young diagrams with boxes erased from their upper right ends. We find formulas for the…
A homothety surface can be assembled from polygons by identifying their edges in pairs via homotheties, which are compositions of translation and scaling. We consider linear trajectories on a 1-parameter family of genus-2 homothety…
Saxl's conjecture (2012) asserts that for the staircase partition $\rho_k = (k, k-1, \ldots, 1)$, the tensor square of the corresponding irreducible representation of the symmetric group $S_{T_k}$ contains every irreducible representation…
Visibility graph reconstruction, which asks us to construct a polygon that has a given visibility graph, is a fundamental problem with unknown complexity (although visibility graph recognition is known to be in PSPACE). We show that two…
The joint spectral radius of a finite set of real d x d matrices is defined to be the maximum possible exponential rate of growth of products of matrices drawn from that set. In previous work with K. G. Hare and J. Theys we showed that for…
Is it possible to draw a circle in Manhattan, using only its discrete network of streets and boulevards? In this study, we will explore the construction and properties of circular paths on an integer lattice, a discrete space where the…
We relate hook-length products for adjacent staircase partitions to special values of Jacobi polynomials. This connection expresses the number of semistandard tableaux in terms of Jacobi polynomials defined via Gauss hypergeometric…
We generalize staircase codes and tiled diagonal zipper codes, preserving their key properties while allowing each coded symbol to be protected by arbitrarily many component codewords rather than only two. This generalization which we term…