English
Related papers

Related papers: Convex Sublattices of a Lattice and a Fixed Point …

200 papers

For a closure space (P,f) with f(\emptyset)=\emptyset, the closures of open subsets of P, called the regular closed subsets, form an ortholattice Reg(P,f), extending the poset Clop(P,f) of all clopen subsets. If (P,f) is a finite convex…

Combinatorics · Mathematics 2013-07-08 Luigi Santocanale , Friedrich Wehrung

For a partially ordered set P, we denote by Co(P) the lattice of order-convex subsets of P. We find three new lattice identities, (S), (U), and (B), such that the following result holds. Theorem. Let L be a lattice. Then L embeds into some…

General Mathematics · Mathematics 2007-05-23 Marina V. Semenova , Friedrich Wehrung

The special linear group G=SL_n(Z[x1,...,xk]) (n at least 3 and k finite) is called the universal lattice. Let n be at least 4, p be any real number in (1,\infty). The main result is the following: any finite index subgroup of G has the…

Group Theory · Mathematics 2011-06-08 Masato Mimura

We prove the following result: Let K be a lattice, let D be a distributive lattice with zero, and let $\phi$: Con K $\to$ D be a {∨, 0}-homomorphism, where Conc K denotes the {∨, 0}-semilattice of all finitely generated…

General Mathematics · Mathematics 2007-05-23 Friedrich Wehrung

Following G. Gr\"atzer and E. Knapp (2007), a slim semimodular lattice, SPS lattice for short, is a finite planar semimodular lattice having no $M_3$ as a sublattice. An SPS lattice is a slim rectangular lattice if it has exactly two doubly…

Rings and Algebras · Mathematics 2023-07-17 Gábor Czédli

This paper first gives a necessary and sufficient condition that a lattice $L$ can be represented as the collection of all up-sets of a poset. Applying the condition, it obtains a necessary and sufficient condition that a lattice can be…

Representation Theory · Mathematics 2017-01-17 Peng He , Xue-ping Wang

A lattice L is called opc if every monotone function f : L^n -> L is induced by a polynomial. We show here: If L is a lattice with the interpolation property whose cardinality is a strong limit cardinal of uncountable cofinality, then some…

Logic · Mathematics 2007-05-23 Martin Goldstern , Saharon Shelah

Properties of several sorts of lattices of convex subsets of R^n are examined. The lattice of convex sets containing the origin turns out, for n>1, to satisfy a set of identities strictly between those of the lattice of all convex subsets…

Metric Geometry · Mathematics 2007-06-13 George M. Bergman

For a finite non-empty set $X$, let $\mathfrak{P}(X)$ denote the set of all posets with carrier $X$, ordered by inclusion of their partial order relations. We investigate properties of posets $P \in \mathfrak{P}(X)$ for which no lower cover…

Combinatorics · Mathematics 2025-05-20 Frank a Campo

Every homomorphism from finite index subgroups of a universal lattices to mapping class groups of orientable surfaces (possibly with punctures), or to outer automorphism groups of finitely generated nonabelian free groups must have finite…

Group Theory · Mathematics 2011-06-21 Masato Mimura

We prove that a closed convex subset $C$ of a real Hilbert space $X$ has the fixed point property for $(c)$-mappings if and only if $C$ is bounded. Some convergence results about the iterations are obtained.

Functional Analysis · Mathematics 2025-11-04 Sami Atailia , Abdelkader Dehici , Najeh Redjel

We denote by Conc(L) the semilattice of all finitely generated congruences of a lattice L. For varieties (i.e., equational classes) V and W of lattices such that V is contained neither in W nor its dual, and such that every simple member of…

Logic · Mathematics 2014-03-24 Pierre Gillibert

We introduce a pointfree theory of convergence on lattices and coframes. A convergence lattice is a lattice $L$ with a monotonic map $\lim_L$ from the lattice of filters on $L$ to $L$, meant to be an abstract version of the map sending…

General Topology · Mathematics 2021-01-13 Jean Goubault-Larrecq , Frédéric Mynard

There is a hierarchy of structure conditions for convex sets. In this paper we study a recently defined [3, 8, 9] condition called locally nonconical convexity (abbreviated LNC). Is is easy to show that every strictly convex set is LNC, as…

Functional Analysis · Mathematics 2016-09-07 C. A. Akemann , G. C. Shell , N. Weaver

The Congruence Lattice Problem (CLP), stated by R. P. Dilworth in the forties, asks whether every distributive {∨, 0}-semilatticeS is isomorphic to the semilattice Conc L of compact congruences of a lattice L. While this problem is…

General Mathematics · Mathematics 2007-05-23 Jiri Tuma , Friedrich Wehrung

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…

Functional Analysis · Mathematics 2021-03-25 Mikael de la Salle

The purpose of this paper is to study convex bodies $C$ for which there exists no convex body $C^\prime\subsetneq C$ of the same lattice width. Such bodies shall be called ``lattice reduced'', and they occur naturally in the study of the…

Metric Geometry · Mathematics 2024-07-23 Giulia Codenotti , Ansgar Freyer

We give several characterizations of order continuous vector lattice homomorphisms between Archimedean vector lattices. We reduce the proofs of some of the equivalences to the case of composition operators between vector lattices of…

Functional Analysis · Mathematics 2024-03-13 Eugene Bilokopytov

For P a poset or lattice, let Id(P) denote the poset, respectively, lattice, of upward directed downsets in P, including the empty set, and let id(P)=Id(P)-\{\emptyset\}. This note obtains various results to the effect that Id(P) is always,…

Rings and Algebras · Mathematics 2013-05-10 George M. Bergman

A simple but elegant result of Rival states that every sublattice $L$ of a finite distributive lattice $\mathcal{P}$ can be constructed from $\mathcal{P}$ by removing a particular family $\mathcal{I}_L$ of its irreducible intervals.…

Combinatorics · Mathematics 2016-04-19 Mark Siggers
‹ Prev 1 2 3 10 Next ›