Related papers: Recursive generation of IPR fullerenes
The forest-of-octrees approach to parallel adaptive mesh refinement and coarsening (AMR) has recently been demonstrated in the context of a number of large-scale PDE-based applications. Although linear octrees, which store only leaf…
We present a new recursive generation algorithm for prefix normal words. These are binary strings with the property that no substring has more 1s than the prefix of the same length. The new algorithm uses two operations on binary strings,…
A $(3, 6)$-fullerene is a cubic planar graph whose faces all have 3 or 6 sides. We give an exact enumeration of $(3, 6)$-fullerenes with $V$ vertices. We also enumerate $(3, 6)$-fullerenes with mirror symmetry, with 3-fold rotational…
We present an algorithm for generating all derivative superstructures--for arbitrary parent structures and for any number of atom types. This algorithm enumerates superlattices and atomic configurations in a geometry-independent way. The…
In this paper, we present a new class of invertible transformations with an application to flow-based generative models. We indicate that many well-known invertible transformations in reversible logic and reversible neural networks could be…
In this article we will describe an algorithm to constructively enumerate non-isomorphic Union closed Sets and Moore sets. We confirm the number of isomorphism classes of Union closed Sets and Moore sets on n<=6 elements presented by other…
We obtain 866 isomorphism classes of five-dimensional nonsingular toric Fano varieties using a computer program and the database of four-dimensional reflexive polytopes. The algorithm is based on the existence of facets of Fano polytopes…
In this paper we study a class of dynamical systems generated by iterations of multivariate polynomials and estimate the degreegrowth of these iterations. We use these estimates to bound exponential sums along the orbits of these dynamical…
Transformer models have established new benchmarks in natural language processing; however, their increasing depth results in substantial growth in parameter counts. While existing recurrent transformer methods address this issue by…
We present a new algorithm to compute all the chiral polytopes that have a given group $G$ as full automorphism group. This algorithm uses a new set of generators that characterize the group, all of them except one being involutions. It…
A method to construct and count all the linear codes (of arbitrary length) in $\mathbb{F}_{4}$ that are invariant under reverse permutation and that contain the repetition code is presented. These codes are suitable for constructing DNA…
While persistent homology has taken strides towards becoming a wide-spread tool for data analysis, multidimensional persistence has proven more difficult to apply. One reason is the serious drawback of no longer having a concise and…
In this paper, we introduce a novel non-linear uniform subdivision scheme for the generation of curves in $\mathbb{R}^n$, $n\geq2$. This scheme is distinguished by its capacity to reproduce second-degree polynomial data on non-uniform grids…
Let $S$ be a rational fraction and let $f$ be a polynomial over a finite field. Consider the transform $T(f)=\operatorname{numerator}(f(S))$. In certain cases, the polynomials $f$, $T(f)$, $T(T(f))\dots$ are all irreducible. For instance,…
We use a constructive method to obtain all but finitely many p-local representation zeta functions of a family Mn of finitely generated nilpotent groups with maximal nilpotency class. For representation dimensions coprime to all primes p <…
We consider recursive decoding techniques for RM codes, their subcodes, and newly designed codes. For moderate lengths up to 512, we obtain near-optimum decoding with feasible complexity.
Synthetic polymeric materials underpin fundamental technologies in the energy, electronics, consumer goods, and medical sectors, yet their development still suffers from prolonged design timelines. Although polymer informatics tools have…
A family of unusually stable boron cages was identified and examined using first-principles local density functional method. The structure of the fullerenes is similar to that of the B12 icosahedron and consists of six crossing…
We propose a strategy for the generation of fast and accurate versions of non-commutative recursive matrix multiplication algorithms. To generate these algorithms, we consider matrix and tensor norm bounds governing the stability and…
In this paper, we describe a robust algorithm for 2-Manifold generation of various kinds of ShapeNet Models. The input of our pipeline is a triangle mesh, with a set of vertices and triangular faces. The output of our pipeline is a…