Related papers: Counting Hexagonal Lattice Animals
Homogeneous generative meta-programming (HGMP) enables the generation of program fragments at compile-time or run-time. We present the first foundational calculus which can model powerful HGMP languages such as Template Haskell. The…
Lattices and their order diagrams are an essential tool for communicating knowledge and insights about data. This is in particular true when applying Formal Concept Analysis. Such representations, however, are difficult to comprehend by…
The Carrell-Chapuy recurrence formulas dramatically improve the efficiency of counting orientable rooted maps by genus, either by number of edges alone or by number of edges and vertices. This paper presents an implementation of these…
We give an algorithm for finding conformal mappings onto the upper half-plane and conformal modules of some types of polygons. The polygons are obtained by stretching along the real axis polyominoes i.e., polygons which are connected unions…
We shortly describe the algorithms behind some of the functions provided by the Macaulay2 package MultiprojectiveVarieties, a package for multi-projective varieties and rational maps between them.
Traditional language processing tools constrain language designers to specific kinds of grammars. In contrast, model-based language processing tools decouple language design from language processing. These tools allow the occurrence of…
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…
Tame functions are a class of nonsmooth, nonconvex functions, which feature in a wide range of applications: functions encountered in the training of deep neural networks with all common activations, value functions of mixed-integer…
A connected set in a graph is a non-empty set of vertices that induces a connected subgraph. In an infinite lattice, a connected set is often referred to as a lattice animal, whose enumeration up to isomorphism is a classical problem in…
We present a new and more efficient implementation of transfer-matrix methods for exact enumerations of lattice objects. The new method is illustrated by an application to the enumeration of self-avoiding polygons on the square lattice. A…
The Tutte polynomial for matroids is not directly applicable to polymatroids. For instance, deletion-contraction properties do not hold. We construct a polynomial for polymatroids which behaves similarly to the Tutte polynomial of a…
Predicting protein secondary structure using lattice model is one of the most studied computational problem in bioinformatics. Here secondary structure or three dimensional structure of protein is predicted from its amino acid sequence.…
Training deep learning (DL) models across Graphics Processing Unit (GPU) clusters is technically challenging. One aspect is that users have to compose command lines to adapt to the heterogeneous launchers, schedulers, affinity options, DL…
The paper deals with the process of mathematical modeling representations of exponential and logarithmic functions hypercomplex number system of generalized quaternions via determining a linear differential equation with hypercomplex…
Orthogonal polynomials are of fundamental importance in many fields of mathematics and science, therefore the study of a particular family is always relevant. In this manuscript, we present a survey of some general results of the Hermite…
A new method is proposed to derive rigorous bounds on {\eta}, the growth rate of the logarithm of the number of independent sets on a hexagonal lattice. Specifically, we prove that 1.546440708536001 <= {\eta} <= 1.5513, which improves upon…
We are interested in representations and characterizations of lattice polynomial functions f:L^n -> L, where L is a given bounded distributive lattice. In companion papers [arXiv 0901.4888, arXiv 0808.2619], we investigated certain…
We consider Hermite-Pad\'e approximants in the framework of discrete integrable systems defined on the lattice $\mathbb{Z}^2$. We show that the concept of multiple orthogonality is intimately related to the Lax representations for the…
Zeilberger's enumeration schemes can be used to completely automate the enumeration of many permutation classes. We extend his enumeration schemes so that they apply to many more permutation classes and describe the Maple package WILFPLUS,…
We describe a practical algorithm which computes the accepting automaton for the insertion encoding of a permutation class, whenever this insertion encoding is regular. This algorithm is implemented in the accompanying Maple package INSENC,…