The solutions of Toda lattice and Volterra lattice

This paper presents a method to directly construct explicit exact solutions to nonlinear differential-difference equations. One applies this approach to solve Volterra lattice and Toda lattice and obtain their some special solutions which contain soliton solutions and periodic solutions.     

Convex lattice polygons with all lattice points visible

Two lattice points are visible to one another if there exist no other lattice points on the line segment connecting them. In this paper we study convex lattice polygons that contain a lattice point such that all other lattice points in the polygon are visible from it. We completely classify such polygons, show that there are finitely many of lattice width greater than 2, and computationally enumerate them. As an application of this classification, we prove new obstructions to graphs arising as skeleta of tropical plane curves.     

HV-拟格

利用HV-结构的概念,引入了HV-拟格,子HV-拟格概念,并研究了HV-拟格的直积以及HV-拟格的同态和同构,得到了关于HV-拟格的一些结果.     

The lattice of closure operators on a subgroup lattice

We say a lattice L is a subgroup lattice if there exists a group G such that Sub(G)?L, where Sub(G) is the lattice of subgroups of G, ordered by inclusion. We prove that the lattice of closure operators which act on the subgroup lattice of a finite group G is itself a subgroup lattice if and only if G is cyclic of prime power order.     

On lattice embeddings of a lattice into its intervals

The notion of idempotent modification of an algebra was introduced by Ježek; he proved that the idempotent modification of a group is always subdirectly irreducible. In the present note we show that the idempotent modification of a generalized MV -algebra having more than two elements is directly irreducible if and only if there exists an element in A which fails to be boolean. Some further results on idempotent modifications are also proved.     

Modified Ringel-Hall algebras,naive lattice algebras and lattice algebras

For a given hereditary abelian category satisfying some finiteness conditions, in certain twisted cases it is shown that the modified Ringel-Hall algebra is isomorphic to the naive lattice algebra and there exists an epimorphism from the modified Ringel-Hall algebra to the lattice algebra. Furthermore, the kernel of this epimorphism is described explicitly. Finally, we show that the naive lattice algebra is invariant under the derived equivalences of hereditary abelian categories.     

Projectivity of the free Banach lattice generated by a lattice

We study the projectivity of the free Banach lattice generated by a lattice $${\mathbb {L}}$$ in two cases: when the lattice is finite, and when the lattice is an infinite linearly ordered set. We prove that in the first case, it is projective while in the second case, it is not.     

On the interior lattice points of convex lattice 11-gon

A lattice point in the plane is a point with integer coordinates. A lattice polygon K is a polygon whose vertices are lattice points. In this note we prove that any convex lattice 11-gon contains at least 15 interior lattice points.     

OnC 0-semigroups of lattice homomorphisms on a Banach lattice

Ohne Zusammenfassung     

Free lattice algorithms

In the late 1930s Phillip Whitman gave an algorithm for deciding for lattice terms v and u if vu in the free lattice on the variables in v and u. He also showed that each element of the free lattice has a shortest term representing it and this term is unique up to commutivity and associativity. He gave an algorithm for finding this term. Almost all the work on free lattices uses these algorithms. Building on the work of Ralph McKenzie, J. B. Nation and the author have developed very efficient algorithms for deciding if a lattice term v has a lower cover (i.e., if there is a w with w covered by v, which is denoted by w) and for finding them if it does. This paper studies the efficiency of both Whitman's algorithm and the algorithms of Freese and Nation. It is shown that although it is often quite fast, the straightforward implementation of Whitman's algorithm for testing vu is exponential in time in the worst case. A modification of Whitman's algorithm is given which is polynomial and has constant minimum time. The algorithms of Freese and Nation are then shown to be polynomial.     

Fibonacci lattice points

Odd indexed Fibonacci numbers F2n+1 can be written as sums of two squares a ²+b ². In this paper, we study the distribution of the lattice points (a,b) on the circles of radius \(\sqrt{F_{2n}+1}\).     

Hierarchical lattice constructions

Translated from Matematicheskie Zametki, Vol. 51, No. 2, pp. 53–58, February, 1992.