相关论文: Counting Hexagonal Lattice Animals

Counting integer solutions of linear constraints has found interesting applications in various fields. It is equivalent to the problem of counting lattice points inside a polytope. However, state-of-the-art algorithms for this problem…

In this work we announce the Maple package conley to compute connection and C-connection matrices. conley is based on our abstract homological algebra package homalg. We emphasize that the notion of braids is irrelevant for the definition…

We offer a Maple package {\tt Poincare\_Series} for calculating the Poincar\'e series for the algebras of invariants/covariants of binary forms, for the algebras of joint invariants/covariants of several binary forms, for the kernel of…

We encode arbitrary finite impartial combinatorial games in terms of lattice points in rational convex polyhedra. Encodings provided by these \emph{lattice games} can be made particularly efficient for octal games, which we generalize to…

We compute the first three terms of the 1/d expansions for the growth constants and one-point functions of nearest-neighbour lattice trees and lattice (bond) animals on the integer lattice Zd, with rigorous error estimates. The proof uses…

We introduce the hook length expansion technique and explain how to discover old and new hook length formulas for partitions and plane trees. The new hook length formulas for trees obtained by our method can be proved rather easily, whereas…

A package of Maple 5.3 commands for doing calculations with anticommutative variables is presented.

We denote a polygon as a connected component in Cayley tree of order 2 containing certain number of fix vertices. We found an exact formula for a polygon counting problem for two cases, in which, for the first case the polygon contain a…

This document is a companion for the Maple program \textbf{Summing a polynomial function over integral points of a polygon}. It contains two parts. First, we see what this programs does. In the second part, we briefly recall the…

Here we present the reasoning behind, and program to find, the generating functions for the number of permutations in the title. The article duals as the "accompanying" Maple package.

In the first part of this paper I give an elementary overview about some number sequences which count various sorts of lattice paths in strips along the x-axis and compute their generating functions in terms of Fibonacci and Lucas…

Here we introduce simple structures for the analysis of complex hypergraphs, hypergraph animals. These structures are designed to describe the local node neighbourhoods of nodes in hypergraphs. We establish their relationships to lattice…

Although digital fabrication processes at the desktop scale have become proficient and prolific, systems aimed at producing larger-scale structures are still typically complex, expensive, and unreliable. In this work, we present an approach…

This article introduces a new, simple solvable lattice for directed animals: the directed king's lattice, or square lattice with next nearest neighbor bonds and preferred directions {W, NW, N, NE, E}. We show that the directed animals in…

We perform numerical simulations of the lattice-animal problem at the upper critical dimension d=8 on hypercubic lattices in order to investigate logarithmic corrections to scaling there. Our stochastic sampling method is based on the…

We give an overview of the Macaulay2 package Matroids, which contains functionality to create and compute with matroids. Examples highlighting the use of all major functions in the package are provided, along with explanations of some of…

Consider a random three-coordinate lattice of spherical topology having 2v vertices and being densely covered by a single closed, self-avoiding walk, i.e. being equipped with a Hamiltonian cycle. We determine the number of such objects as a…

We consider inhomogeneous lattice walk models in a half-space and in the quarter plane. For the models in a half-space, we show by a generalization of the kernel method to linear systems of functional equations that their generating…

The connection between matrix integrals and links is used to define matrix models which count alternating tangles in which each closed loop is weighted with a factor n, i.e. may be regarded as decorated with n possible colors. For n=2, the…

A collection of subroutines and examples of their uses, as well as the underlying numerical methods, are described for generating orthogonal polynomials relative to arbitrary weight functions. The object of these routines is to produce the…