相关论文: Implication semilattice of 990 quasigroup equation…

A subsemigroup S of a semigroup Q is a left order in Q and Q is a semigroup of left quotients of S if every element of Q can be expressed as a# b where a and b are elements of S and if, in addition, every element of S that is square…

In 1985, Bucher, Ehrenfeucht and Haussler studied derivation relations associated with a given set of context-free rules. Their research motivated a question regarding homomorphisms from the semigroup of all words onto a finite ordered…

In this paper, we introduce a novel first-order derivative for functions on a lattice graph, which extends the discrete Laplacian and generalizes the theory of discrete PDEs on lattices. First, we establish the well-posedness of generalized…

The main goal of this note is to suggest an algebraic approach to the quasi-isometric classification of partially commutative groups (alias right-angled Artin groups). More precisely, we conjecture that if the partially commutative groups…

This paper is concerned with discrete, uniform subgroups (lattices) of oscillator groups, which are certain semidirect products of the Heisenberg group and the additive group of real numbers. The present paper rectifies the uncertainties in…

We proceed the research of generalized quasigroup derivatives started in early papers of the last co-author ([20, p. 212], [13]). For any quasigroup there exist 648 generalized derivatives. Here we study the problem about existence of units…

We prove that for any free lattice F with at least $\aleph\_2$ generators in any non-distributive variety of lattices, there exists no sectionally complemented lattice L with congruence lattice isomorphic to the one of F. This solves a…

The reconstruction theorem and the multilevel Schauder estimate have central roles in the analytic theory of regularity structures [17]. Inspired by [26], we provide elementary proofs for them by using the semigroup of operators.…

Quasi-lattices are introduced in terms of 'join' and 'meet' operations. It is observed that quasi-lattices become lattices when these operations are associative and when these operations satisfy 'modularity' conditions. A fundamental…

The notion of quasi-elliptic rings appeared as a result of an attempt to classify a wide class of commutative rings of operators found in the theory of integrable systems, such as rings of commuting differential, difference,…

This paper introduces the tensor representation of a network, here tensors are the primitive structures of the network. In view of tensor chains, two binary operations on tensor sets are defined: chain addition and reducing. Based on the…

We study admissible and equivalence point transformations between generalized multidimensional nonlinear Schr\"odinger equations and classify Lie symmetries of such equations. We begin with a wide superclass of Schr\"odinger-type equations,…

A unitary representation of a, possibly infinite dimensional, Lie group G is called semi-bounded if the corresponding operators id\pi(x) from the derived representations are uniformly bounded from above on some non-empty open subset of the…

We prove that an irreducible lattice in a semisimple algebraic group is virtually isomorphic to an arithmetic lattice if and only if it admits a faithful self-similar action on a rooted tree of finite valency.

We prove a product theorem for sublinear bilipschitz equivalences which generalizes the classical work of Kapovich, Kleiner and Leeb on quasiisometries between product spaces. We employ our product theorem to distinguish up to quasiisometry…

The class of all quasigroups is covered by six classes: the class of all asymmetric quasigroups and five varieties of quasigroups (commutative, left symmetric, right symmetric, semi-symmetric and totally symmetric). Each of these classes is…

We complete the quasi-isometric classification of irreducible lattices in semisimple Lie groups over nondiscrete locally compact fields of characteristic zero by showing that any quasi-isometry of a rank one S-arithmetic lattice in a…

Two semigroups are lattice isomorphic if the lattices of their subsemigroups are isomorphic, and a class of semigroups is lattice closed if it contains every semigroup which is lattice isomorphic to some semigroup from that class. An…

The natural join and the inner union operations combine relations of a database. Tropashko and Spight realized that these two operations are themeet and join operations in a class of lattices, known by now as the relational lattices. They…

Let A, B, S be categories, let F:A-->S and G:B-->S be functors. We assume that for "many" objects a in A, there exists an object b in B such that F(a) is isomorphic to G(b). We establish a general framework under which it is possible to…