Related papers: Filter classes of upsets of distributive lattices
In this paper we study the dense elements and the radical of a residuated lattice, residuated lattices with lifting Boolean center, simple, local, semilocal and quasi-local residuated lattices. BL-algebras have lifting Boolean center;…
Group lifting structures are introduced to provide an algebraic framework for studying lifting factorizations of two-channel perfect reconstruction finite-impulse-response (FIR) filter banks. The lifting factorizations generated by a group…
For certain weak versions of the Axiom of Choice (most notably, the Boolean Prime Ideal theorem), we obtain equivalent formulations in terms of partial orders, and filter-like objects within them intersecting certain dense sets or…
We show that all balanced d-lattices must be complemented, answering a question of Chajda and Eigenthaler. (A bounded lattice is balanced if any two congruences agree on their 1-classes iff they agree on their 0-classes.) Our main tool is…
Let $G$ be a finite group, and let $\Delta(G)$ be the prime graph built on the set of conjugacy class sizes of $G$: this is the simple undirected graph whose vertices are the prime numbers dividing some conjugacy class size of $G$, two…
We investigate correspondence functors, namely the functors from the category of finite sets and correspondences to the category of $k$-modules, where $k$ is a commutative ring.They have various specific properties which do not hold for…
Recently there has been a lot of research and progress in profinite groups. We survey some of the new results and discuss open problems. A central theme is decompositions of finite groups into bounded products of subsets of various kinds…
Starting from filters over the set of indices, we introduce structures in a product of sets where the coordinate sets have the given structures.
We study various combinatorial properties, and the implications between them, for filters generated by infinite-dimensional subspaces of a countable vector space. These properties are analogous to selectivity for ultrafilters on the natural…
We obtain algorithmically effective versions of the dense lattice sphere packings constructed from orders in $\mathbb{Q}$-division rings by the first author. The lattices in question are lifts of suitable codes from prime characteristic to…
A mixed lattice is a lattice-type structure consisting of a set with two partial orderings, and generalizing the notion of a lattice. Mixed lattice theory has previously been studied in various algebraic structures, such as groups and…
Factorization of an $n\times n$ unitary matrix as a product of $n$ diagonal matrices containing only phases interlaced with $n-1$ orthogonal matrices each one generated by a real vector as well as an explicit form for the Weyl factorization…
The characterization of level sets of finite Boolean lattices as antichain cutsets, due to Rival and Zaguia, is seen to hold in all discrete semimodular lattices.
We give a definition of some classes of boolean algebras generalizing free boolean algebras; they satisfy a universal property that certain functions extend to homomorphisms. We give a combinatorial property of generating sets of these…
A self-bound dipolar quantum droplet modulated by an shallow optical latticeare studied. It is found that the behaviors of the droplets in an optical lattice are similar with those without the optical lattice. In the shallow enough limit…
We establish conditions under which lattices in certain simple Lie groups are profinitely solitary in the absolute sense, so that the commensurability class of the profinite completion determines the commensurability class of the group…
We give a combinatorial classification for the class of postcritically fixed Newton maps of polynomials and indicate potential for extensions. As our main tool, we show that for a large class of Newton maps that includes all hyperbolic…
We consider products of $\psi$ classes and products of $\omega$ classes on $\overline{M}_{0,n+3}$. For each product, we construct a flat family of subschemes of $\overline{M}_{0,n+3}$ whose general fiber is a complete intersection…
This paper is motivated by the theory of sequential dynamical systems, developed as a basis for a mathematical theory of computer simulation. It contains a classification of finite dynamical systems on binary strings, which are obtained by…
In this paper we count set closure systems (also known as Moore families) for the case when all single element sets are closed. In particular, we give the numbers of such strict (empty set included) and non-strict families for the base set…