Related papers: A representation theorem for stratified complete l…
The congruence lattices of all algebras defined on a fixed finite set $A$ ordered by inclusion form a finite atomistic lattice $\mathcal E$. We describe the atoms and coatoms. Each meet-irreducible element of $\mathcal E$ being determined…
Let $A$ be a finite or countable alphabet and let $\theta$ be literal (anti)morphism onto $A^*$ (by definition, such a correspondence is determinated by a permutation of the alphabet). This paper deals with sets which are invariant under…
Many problems in nonlinear analysis and optimization, among them variational inequalities and minimization of convex functions, can be reduced to finding zeros (namely, roots) of set-valued operators. Hence numerous algorithms have been…
We establish a necessary and sufficient condition for a representation of a lattice ordered semigroup to be regular, in the sense that certain extensions are completely positive definite. This result generalizes a theorem due to Brehmer…
If a partition of a lattice in R^d is selfsimilar, it is called lattice substitution system (LSS). Such sets represent nonperiodic, but highly ordered structures. An important property of such structures is, whether they are model sets or…
An effective way to design structured coherent wave interference patterns that builds on the theory of coherent lattices, is presented. The technique combines prime number factorization in the complex plane with moir\'e theory to provide a…
We study the model theoretic strength of various lattices that occur naturally in topology, like closed (semi-linear or semi-algebraic or convex) sets. The method is based on weak monadic second order logic and sharpens previous results by…
We introduce so-called consistent posets which are bounded posets with an antitone involution ' where the lower cones of x,x' and of y,y' coincide provided x,y are different form 0,1 and, moreover, if x,y are different form 0 then their…
One of the most beautiful results in the integral representation theory of finite groups is a theorem of A. Weiss that detects a permutation $R$-lattice for the finite $p$-group $G$ in terms of the restriction to a normal subgroup $N$ and…
Nonexpansive mappings play a central role in modern optimization and monotone operator theory because their fixed points can describe solutions to optimization or critical point problems. It is known that when the mappings are sufficiently…
In this work, we discuss completeness for the lattice orders of first and second order stochastic dominance. The main results state that, both, first and second order stochastic dominance induce Dedekind super complete lattices,…
Bilattices (that is, sets with two lattice structures) provide an algebraic tool to model simultaneously the validity of, and knowledge about, sentences in an appropriate language. In particular, certain bilattices have been used to model…
We prove that every lattice in a product of higher rank simple Lie groups or higher rank simple algebraic groups over local fields has Vincent Lafforgue's strong property (T). Over non-archimedean local fields, we also prove that they have…
We systematically investigate the complexity of model checking the existential positive fragment of first-order logic. In particular, for a set of existential positive sentences, we consider model checking where the sentence is restricted…
A residuated lattice is defined to be integrally closed if it satisfies the equations x\x = e and x/x = e. Every integral, cancellative, or divisible residuated lattice is integrally closed, and, conversely, every bounded integrally closed…
The model theory based notion of the first order convergence unifies the notions of the left-convergence for dense structures and the Benjamini-Schramm convergence for sparse structures. It is known that every first order convergent…
A rigorous geometric proof of the Lie's Theorem on nonlinear superposition rules for solutions of non-autonomous ordinary differential equations is given filling in all the gaps present in the existing literature. The proof is based on an…
Finite smooth digraphs, that is, finite directed graphs without sources and sinks, can be partially ordered via pp-constructability. We give a complete description of this poset and, in particular, we prove that it is a distributive…
The truncation operation facilitates the articulation and analysis of several aspects of the structure of archimedean vector lattices; we investigate two such aspects in this article. We refer to archimedean vector lattices equipped with a…
This paper revisits soundness and completeness of proof systems for proving that sets of states in infinite-state labeled transition systems satisfy formulas in the modal mu-calculus. Our results rely on novel results in lattice theory,…