Related papers: Counting the lattice rectangles inside Aztec diamo…
Searches for tetraquarks and mesonic molecules in lattice QCD are briefly reviewed. In the light quark sector the most serious candidates are the lightest scalar resonances sigma, kappa, a0 and f0. In the hidden-charm sector I discuss…
It is shown that any finite, rank-connected, dismantlable lattice is lexicographically shellable (hence Cohen-Macaulay). A ranked, interval-connected lattice is shown to be rank-connected, but a rank-connected lattice need not be…
We study the number of planes for four dimensional projective hypersurfaces which has so-called inductive structure. We also determine transcendental lattices for cubic fourfolds of this type.
A shape's Heesch number is the number of layers of copies of the shape that can be placed around it without gaps or overlaps. Experimentation and exhaustive searching have turned up examples of shapes with finite Heesch numbers up to six,…
Motivated by the problem of counting finite BPS webs, we count certain immersed metric graphs, tripods, on the flat torus. Classical Euclidean geometry turns this into a lattice point counting problem in $\mathbb C^2$, and we give an…
We discuss the construction of oscillator-like systems associated with orthogonal polynomials on the example of the Fibonacci oscillator. In addition, we consider the dimension of the corresponding lie algebras.
We give a formula for the number of lozenge tilings of a hexagon on the triangular lattice with unit triangles removed from arbitrary positions along two non-adjacent, non-opposite sides. Our formula implies that for certain families of…
For a binary quadratic form $Q$, we consider the action of $\mathrm{SO}_Q$ on a two-dimensional vector space. This representation yields perhaps the simplest nontrivial example of a prehomogeneous vector space that is not irreducible, and…
We prove an integral formula for continuous paths of rectangles inscribed in a piecewise smooth loop. We then use this integral formula to show that (with a very mild genericity hypothesis) the number of rectangle coincidences, informally…
In this paper, we count all non-isomorphic lattices on $n$ elements, containing four reducible elements and having nullity three. This work is in respect of Birkhoff's open problem (which is NP-complete) of counting all finite lattices on…
We count the number of conics through two general points in complete intersections when this number is finite and give an application in terms of quasi-lines.
Planes are familiar mathematical objects which lie at the subtle boundary between continuous geometry and discrete combinatorics. A plane is geometrical, certainly, but the ways that two planes can interact break cleanly into discrete sets:…
After a short review of the Method of Recursive Counting we introduce a general algebraic description of recursive lattice building. This provides a rigorous framework for discussion of method's limitations.
The number of Young Tableaux whose shape is a k by n rectangle is famously (nk)! 0! ... (k-1)!/((n+k-1)!(n+k-2)!... n!) implying that for each specific k, that sequence satisfies a linear recurrence equation with polynomial coefficients of…
In general graph theory, the only relationship between vertices are expressed via the edges. When the vertices are embedded in an Euclidean space, the geometric relationships between vertices and edges can be interesting objects of study.…
Random tilings of the two-periodic Aztec diamond contain three macroscopic regions: frozen, where the tilings are deterministic; rough, where the correlations between dominoes decay polynomially; smooth, where the correlations between…
We reduce the problem of counting self-avoiding walks in the square lattice to a problem of counting the number of integral points in multidimensional domains. We obtain an asymptotic estimate of the number of self-avoiding walks of length…
We investigate paths in the hexagonal circle packing and enumerate them with respect to width, height, number of steps, area, and kissing number. Functional equations and the kernel method yield closed bivariate generating functions…
This paper investigates low-dimensional quantizers from the perspective of complex lattices. We adopt Eisenstein integers and Gaussian integers to define checkerboard lattices $\mathcal{E}_{m}$ and $\mathcal{G}_{m}$. By explicitly linking…
In this paper we are constructing integer lattice squares, cubes or hypercubes in $\mathbb R^d$ with $d\in \{2,3,4\}$. For squares and cubes we find a complete description of their Ehrhart polynomial. For hypercubes, we compute one of the…