skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: Introducing Boolean Semilattices
We present and discuss a variety of Boolean algebras with operators that is closely related to the variety generated by all complex algebras of semilattices. We consider the problem of finding a generating set for the variety, representation questions, and axiomatizability. Several interesting subvarieties are presented. We contrast our results with those obtained for a number of other varieties generated by complex algebras of groupoids.  more » « less
Award ID(s):
1500218
PAR ID:
10099046
Author(s) / Creator(s):
Date Published:
Journal Name:
Don Pigozzi on Algebraic Logic
Page Range / eLocation ID:
103-130
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. We construct explicit deterministic extractors for polynomial images of varieties, that is, distributions sampled by applying a low-degree polynomial map 𝑓 to an element sampled uniformly at random from a 𝑘-dimensional variety 𝑉. This class of sources generalizes both polynomial sources, studied by Dvir, Gabizon and Wigderson (FOCS 2007, Comput. Complex. 2009), and variety sources, studied by Dvir (CCC 2009, Comput. Complex. 2012). Assuming certain natural non-degeneracy conditions on the map 𝑓 and the variety 𝑉 , which in particular ensure that the source has enough min-entropy, we extract almost all the min-entropy of the distribution. Unlike the Dvir–Gabizon–Wigderson and Dvir results, our construction works over large enough finite fields of arbitrary characteristic. One key part of our construction is an improved deterministic rank extractor for varieties. As a by-product, we obtain explicit Noether normalization lemmas for affine varieties and affine algebras. Additionally, we generalize a construction of affine extractors with exponentially small error due to Bourgain, Dvir and Leeman (Comput. Complex. 2016) by extending it to all finite prime fields of quasipolynomial size. 
    more » « less
  2. Using the Zhu algebra for a certain category of C-graded vertex algebras V, we prove that if V is finitely Ω-generated and satisfies suitable grading conditions, then V is rational, i.e., it has semi-simple representation theory, with a one-dimensional level zero Zhu algebra. Here, Ω denotes the vectors in V that are annihilated by lowering the real part of the grading. We apply our result to the family of rank one Weyl vertex algebras with conformal element ωΌ parameterized by Ό∈C and prove that for certain non-integer values of ÎŒ, these vertex algebras, which are non-integer graded, are rational, with a one-dimensional level zero Zhu algebra. In addition, we generalize this result to appropriate C-graded Weyl vertex algebras of arbitrary ranks. 
    more » « less
  3. Spatially distributed networks of large size arise in a variety of science and engineering problems, such as wireless sensor networks and smart power grids. Most of their features can be described by properties of their state-space matrices whose entries have indices in the vertex set of a graph. In this paper, we introduce novel algebras of Beurling type that contain matrices on a connected simple graph having polynomial off-diagonal decay, and we show that they are Banach subalgebras of the space of all bounded operators on the space of all p-summable sequences. The $$\ell^p$$-stability of state-space matrices is an essential hypothesis for the robustness of spatially distributed networks. In this paper, we establish the equivalence among -stabilities of matrices in Beurling algebras for different exponents $$p$$, with quantitative analysis for the lower stability bounds. Admission of norm-control inversion plays a crucial role in some engineering practice. In this paper, we prove that matrices in Beurling subalgebras of have norm-controlled inversion and we find a norm-controlled polynomial with close to optimal degree. Polynomial estimate to powers of matrices is important for numerical implementation of spatially distributed networks. In this paper, we apply our results on norm-controlled inversion to obtain a polynomial estimate to powers of matrices in Beurling algebras. The polynomial estimate is a noncommutative extension about convolution powers of a complex function and is applicable to estimate the probability of hopping from one agent to another agent in a stationary Markov chain on a spatially distributed network. 
    more » « less
  4. Abstract We describe a connection between the subjects of cluster algebras, polynomial identity algebras, and discriminants. For this, we define the notion of root of unity quantum cluster algebras and prove that they are polynomial identity algebras. Inside each such algebra we construct a (large) canonical central subalgebra, which can be viewed as a far reaching generalization of the central subalgebras of big quantum groups constructed by De Concini, Kac, and Procesi and used in representation theory. Each such central subalgebra is proved to be isomorphic to the underlying classical cluster algebra of geometric type. When the root of unity quantum cluster algebra is free over its central subalgebra, we prove that the discriminant of the pair is a product of powers of the frozen variables times an integer. An extension of this result is also proved for the discriminants of all subalgebras generated by the cluster variables of nerves in the exchange graph. These results can be used for the effective computation of discriminants. As an application we obtain an explicit formula for the discriminant of the integral form over of each quantum unipotent cell of De Concini, Kac, and Procesi for arbitrary symmetrizable Kac–Moody algebras, where is a root of unity. 
    more » « less
  5. We prove that large classes of algebras in the framework of root of unity quantum cluster algebras have the structures of maximal orders in central simple algebras and Cayley–Hamilton algebras in the sense of Procesi. We show that every root of unity upper quantum cluster algebra is a maximal order and obtain an explicit formula for its reduced trace. Under mild assumptions, inside each such algebra we construct a canonical central subalgebra isomorphic to the underlying upper cluster algebra, such that the pair is a Cayley–Hamilton algebra; its fully Azumaya locus is shown to contain a copy of the underlying cluster A \mathcal {A} -variety. Both results are proved in the wider generality of intersections of mixed quantum tori over subcollections of seeds. Furthermore, we prove that all monomial subalgebras of root of unity quantum tori are Cayley–Hamilton algebras and classify those ones that are maximal orders. Arbitrary intersections of those over subsets of seeds are also proved to be Cayley–Hamilton algebras. Previous approaches to constructing maximal orders relied on filtration and homological methods. We use new methods based on cluster algebras. 
    more » « less