相关论文: Counting Hexagonal Lattice Animals
Two new classes of finite automata, called General hexagonal Boustrophedon finite automata and General hexagonal returning finite automata operating on hexagonal grids, are introduced and analyzed. The work establishes the theoretical…
We work with lattice walks in $\mathbb{Z}^{r+1}$ using step set $\{\pm 1\}^{r+1}$ that finish with $x_{r+1} = 0$. We further impose conditions of avoiding backtracking (i.e. $[v,-v]$) and avoiding consecutive steps (i.e. $[v,v]$) each…
We define and study the Tutte polynomial of a hyperplane arrangement. We introduce a method for computing it by solving an enumerative problem in a finite field. For specific arrangements, the computation of Tutte polynomials is then…
We propose a method to calculate the Greens function of a free massive scalar field on the lattice numerically to very high precision. For masses m < 2 (in lattice units) the massive Greens function can be expressed recursively in terms of…
We offer a Maple package SL\_2\_Inv\_Ker for calculating of minimal generating sets for the algebras of joint invariants/semi-invariants of binary forms and for calculations of the kernels of Weitzenb\"ock derivations.
Vertex fitting code is commonly found within the analysis packages of several HEP experiments, unfortunately it usually deeply packaged inside their software infrastructure, making it cumbersome to use in the context of external…
Polynomials known as Multiple Orthogonal Polynomials in a single variable are polynomials that satisfy orthogonality conditions concerning multiple measures and play a significant role in several applications such as Hermite-Pad\'e…
We introduce a 2-dimensional lattice model of granular matter. We use a combination of proof and simulation to demonstrate an order/disorder phase transition in the model, to which we associate the granular phenomenon of random close…
We define a lattice model for rock, absorbers, and gas that makes it possible to examine the flow of gas to a complicated absorbing boundary over long periods of time. The motivation is to deduce the geometry of the boundary from the time…
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 introduce an algorithm for computing closure systems derived from a family of implications on a set. Semilattices presentations are explored and used in conjunction with the algorithm to compute various types of lattices freely generated…
There are many structures, both classical and modern, involving point-sets and polygons whose deeper understanding can be facilitated through interactive visualizations. The Ipe extensible drawing editor, developed by Otfried Cheong, is a…
Snake graphs and their perfect matchings play a key role in the description of cluster variables of cluster algebras associated to surfaces. In this paper, we introduce triangular snake graphs and establish a bijection between their routes…
We introduce the notion of a polyptych lattice, which encodes a collection of lattices related by piecewise linear bijections. We initiate a study of the new theory of convex geometry and polytopes associated to polyptych lattices. In…
In this paper we propose an approach for computing multiple high-quality near-isometric dense correspondences between a pair of 3D shapes. Our method is fully automatic and does not rely on user-provided landmarks or descriptors. This…
A geometric study of twin and grain boundaries in crystals and quasicrystals is achieved via coincidence site lattices (CSLs) and coincidence site modules (CSMs), respectively. Recently, coincidences of shifted lattices and multilattices…
This article introduces the pammtools package, which facilitates data transformation, estimation and interpretation of Piece-wise exponential Additive Mixed Models. A special focus is on time-varying effects and cumulative effects of…
A gain graph is a graph whose edges are orientably labelled from a group. A weighted gain graph is a gain graph with vertex weights from an abelian semigroup, where the gain group is lattice ordered and acts on the weight semigroup. For…
We generalize the Hamiltonian Monte Carlo algorithm with a stack of neural network layers and evaluate its ability to sample from different topologies in a two dimensional lattice gauge theory. We demonstrate that our model is able to…
We give a systematic presentation of relations between lattice gas models with hard-core interactions, enumeration of directed-site animals, and the algebra of formal power-series in the partially commutative case, along the work of…