Related papers: The degree of symmetry of lattice paths
Highly-regular graphs can be regarded as a combinatorial generalization of distance-regular graphs. From this standpoint, we study combinatorial aspects of highly-regular graphs. As a result, we give the following three main results in this…
We give a bijection between partially directed paths in the symmetric wedge y= +/-x and matchings, which sends north steps to nestings. This gives a bijective proof of a result of Prellberg et al. that was first discovered through the…
This paper presents the asymptotic analysis of random lattices in high dimensions to clarify the distance properties of the considered lattices. These properties not only indicate the asymptotic value for the distance between any pair of…
A graph $G$ is said to be determined by the spectrum of its Laplacian matrix (DLS) if every graph with the same spectrum is isomorphic to $G$. van Dam and Haemers (2003) conjectured that almost all graphs have this property, but that is…
The symmetry of the whole experimental setups, including specific sample environments and measurables, can be compared with that of specimens for observable physical phenomena. We, first, focus on one-dimensional (1D) experimental setups,…
We study some distributive lattices arising in the combinatorics of lattice paths. In particular, for the Dyck, Motzkin and Schroder lattices we describe the spectrum and we determine explicitly the Euler characteristic in terms of natural…
In this paper several examples of gaps (lacunes) between dimensions of maximal and submaximal symmetric models are considered, which include investigation of number of independent linear and quadratic integrals of metrics and counting the…
An intuitive property of a random graph is that its subgraphs should also appear randomly distributed. We consider graphs whose subgraph densities exactly match their expected values. We call graphs with this property for all subgraphs with…
We examine the diffraction properties of lattice dynamical systems of algebraic origin. It is well-known that diverse dynamical properties occur within this class. These include different orders of mixing (or higher-order correlations), the…
The number of down-steps between pairs of up-steps in $k_t$-Dyck paths, a generalization of Dyck paths consisting of steps $\{(1, k), (1, -1)\}$ such that the path stays (weakly) above the line $y=-t$, is studied. Results are proved…
One common type of symmetry is when values are symmetric. For example, if we are assigning colours (values) to nodes (variables) in a graph colouring problem then we can uniformly interchange the colours throughout a colouring. For a…
This paper concerns the number of lattice points in the plane which are visible along certain curves to all elements in some set S of lattice points simultaneously. By proposing the concept of level of visibility, we are able to analyze…
We consider random paths on a square lattice which take a left or a right turn at every vertex. The possible turns are taken with equal probability, except at a vertex which has been visited before. In such case the vertex is left via the…
A geometric grid class consists of those permutations that can be drawn on a specified set of line segments of slope \pm1 arranged in a rectangular pattern governed by a matrix. Using a mixture of geometric and language theoretic methods,…
We prove that a graph G is asymptotically isomorphic to the ray if and only if G is uniformly spherically bounded and is of bounded local degrees. This problem arouse in combinatorics and was posed in [3] (Problem 10.1).
We enumerate the edges in the Hasse diagram of several lattices arising in the combinatorial context of lattice paths. Specifically, we will consider the case of Dyck, Grand Dyck, Motzkin, Grand Motzkin, Schr\"oder and Grand Schr\"oder…
A recurrence relation of the generating function of the dimer model of Fibonacci type gives a functional relation for formal power series associated to lattice paths such as a Dyck, Motzkin and Schr\"oder path. In this paper, we generalize…
Random operators constitute fundamental building blocks of models of complex systems yet are far from fully understood. Here, we explain an asymmetry emerging upon repeating identical isotropic (uniformly random) operations. Specifically,…
We study the symmetry classes of graphene quantum dots, both open and closed, through the conductance and energy level statistics. For abrupt termination of the lattice, these properties are well described by the standard orthogonal and…
We consider the D1Q3 lattice Boltzmann scheme with an acoustic scale for the simulation of diffusive processes. When the mesh is refined while holding the diffusivity constant, we first obtain asymptotic convergence. When the mesh size…