Pseudo-Heronian triangles whose squares of the lengths of one or two sides are prime numbers

The authors introduced the concept of a pseudo-Heron triangle, such that squares of sides are integers, and the area is an integer multiplied by $2$. The article investigates the case of pseudo-Heron triangles such that the squares of the two sides of the pseudo-Heron triangle are primes of the form $4k+1$. It is proved that for any two predetermined prime numbers of the form $4k+1$ there exist pseudo-Heron triangles with vertices on an integer lattice, such that these two primes are the sides of these triangles and such triangles have a finite number. It is also proved that for any predetermined prime number of the form $4k+1$, there are isosceles triangles with vertices on an integer lattice, such that this prime is equal to the values of two sides and there are only a finite number of such triangles.

Random Integer Lattice Generation via the Hermite Normal Form

Lattices used in cryptography are integer lattices. Defining and generating a “random integer lattice” are interesting topics. A generation algorithm for a random integer lattice can be used to serve as a random input of all the lattice algorithms. In this paper, we recall the definition of the random integer lattice given by G. Hu et al. and present an improved generation algorithm for it via the Hermite normal form. It can be proven that with probability ≥0.99, this algorithm outputs an n-dim random integer lattice within O(n2) operations.

Crystal structures and continued fractions

In this paper, we consider the properties of a flat crystal structure associated with the matrix representation of finite continued fractions generating unimodular morphisms of a flat integer lattice. The used matrix representations of the continued fractions and their properties are obtained in [1]. The constructed model allows us to explain the existing limitations of the sets of Weiss parameters (the rational ratio of the lengths of the edges of the forming cell) of crystals by the Gauss-Kuzmin distribution of natural numbers in the representation of continued fractions.

Planar Lattice Subsets with Minimal Vertex Boundary

A subset of vertices of a graph is minimal if, within all subsets of the same size, its vertex boundary is minimal. We give a complete, geometric characterization of minimal sets for the planar integer lattice $X$. Our characterization elucidates the structure of all minimal sets, and we are able to use it to obtain several applications. We show that the neighborhood of a minimal set is minimal. We characterize uniquely minimal sets of $X$: those which are congruent to any other minimal set of the same size. We also classify all efficient sets of $X$: those that have maximal size amongst all such sets with a fixed vertex boundary. We define and investigate the graph $G$ of minimal sets whose vertices are congruence classes of minimal sets of $X$ and whose edges connect vertices which can be represented by minimal sets that differ by exactly one vertex. We prove that G has exactly one infinite component, has infinitely many isolated vertices and has bounded components of arbitrarily large size. Finally, we show that all minimal sets, except one, are connected.