Related papers: CSLs of the root lattice $\mathbf{A_4}$

The problem of classifying equivalence classes of presentations up to isomorphism of Cayley graphs is considered in this article in the case of dicyclic groups. The number of equivalence classes of presentations is uniformly bounded - it is…

Third-order ordinary differential equations with Lie symmetry algebras isomorphic to the nonsolvable algebra $\mathfrak{sl}(2,\mathbb{R})$ admit solvable structures. These solvable structures can be constructed by using the basis elements…

General isometries of cyclic codes, including multipliers and translations, are introduced; and isometrically self-dual cyclic codes are defined. In terms of Type-I duadic splittings given by multipliers and translations, a necessary and…

We determine equivalent conditions between the asymptotic coefficients of the Bessel generating functions of a sequence of probability measures and the asymptotic expected values of power sums when their inputs are sampled from these…

We propose an algebraic and a geometric classification of euclidean isodual lattices of fixed rank. First, we prove that these lattices are distribued according to a finite number of algebraic types. Second, we show that they are…

Skew cyclic codes play the same role as cyclic codes in the theory of error-correcting codes for the rank metric. In this paper, we give descriptions of these codes by root spaces, cyclotomic spaces and idempotent generators. We prove that…

This paper concerns the enumeration of rotation-type and congruence-type convex polyominoes on the square lattice. These can be defined as orbits of the groups C4, of rotations, and D4, of symmetries of the square acting on (translation-…

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…

The statistical convergence is defined for sequences with the asymptotic density on the natural numbers, in general. In this paper, we introduce the statistical convergence for nets in Riesz spaces by using the finite additive measures on…

This paper is an extension of our last 1D, N = 4 supersymmetric SYK paper [arXiv:2103.11899]. In this paper we introduced the complex linear supermultiplet (CLS), which is "usefully inequivalent" to the chiral supermultiplet. We construct…

In this paper, we propose an algebraic approach to determine whether two non-isomorphic caterpillar trees can have the same symmetric function generalization of the chromatic polynomial. On the set of all composition on integers, we…

Strong lensing galaxy clusters provide a unique and powerful way to test simulation-derived structure predictions that follow from $\Lambda$ Cold Dark Matter ($\Lambda$CDM) cosmology. Specifically, the relative alignments of the dark matter…

It is well known that isotopic metrics of positive scalar curvature are concordant. Whether or not the converse holds is an open question, at least in dimensions greater than four. We show that for a particular type of concordance,…

A generic rectangulation is a partition of a rectangle into finitely many interior-disjoint rectangles, such that no four rectangles meet in a point. In this work we present a versatile algorithmic framework for exhaustively generating a…

There is constructed, for each member of a one-parameter family of cosmological models, which is obtained from the Kottler-Schwarzschild-de Sitter spacetime by identification under discrete isometries, a slicing by spherically symmetric…

We study Lie algebras of generators of infinitesimal symmetries of almost-cosymplectic-contact structures of odd dimensional manifolds. The almost-cosymplectic-contact structure admits on the sheaf of pairs of 1-forms and functions the…

We study 1D quasilattices, especially self-similar ones that can be used to generate two-, three- and higher-dimensional quasicrystalline tessellations that have matching rules and invertible self-similar substitution rules (also known as…

We construct a point set in the Euclidean plane that elucidates the relationship between the fine-scale statistics of the fractional parts of $\sqrt n$ and directional statistics for a shifted lattice. We show that the randomly rotated, and…

In this article we continue to develop the theory of generating symmetries for integrable equations. A technique for computation of generating symmetries using Maple is presented. The technique is based on the standard symmetry method. By…

For large ranks, there is no good algorithm that decides whether a given lattice has an orthonormal basis. But when the lattice is given with enough symmetry, we can construct a provably deterministic polynomial-time algorithm to accomplish…