scholarly journals Sunflowers in Lattices

10.37236/1963 ◽  
2005 ◽  
Vol 12 (1) ◽  
Author(s):  
Geoffrey McKenna
Keyword(s):  
Finite Field ◽  
Boolean Lattice ◽  
Distributive Lattices ◽  
Sunflower Lemma

A Sunflower is a subset $S$ of a lattice, with the property that the meet of any two elements in $S$ coincides with the meet of all of $S$. The Sunflower Lemma of Erdös and Rado asserts that a set of size at least $1 + k!(t-1)^k$ of elements of rank $k$ in a Boolean Lattice contains a sunflower of size $t$. We develop counterparts of the Sunflower Lemma for distributive lattices, graphic matroids, and matroids representable over a fixed finite field. We also show that there is no counterpart for arbitrary matroids.

ENDOMORPHISMS OF DISTRIBUTIVE LATTICES WITH A QUANTIFIER

2007 ◽  
Vol 17 (07) ◽  
pp. 1349-1376 ◽  
Author(s):  
M. E. ADAMS ◽  
W. DZIOBIAK
Keyword(s):  
Boolean Lattice ◽  
Distributive Lattices ◽  
Endomorphism Monoid ◽  
Proper Class ◽  
Endomorphism Monoids

Let V be a non-trivial variety of bounded distributive lattices with a quantifier, as introduced by Cignoli in [7]. It is shown that if V does not contain the 4-element bounded Boolean lattice with a simple quantifier, then V contains non-isomorphic algebras with isomorphic endomorphism monoids, but there are always at most two such algebras. Further, it is shown that if V contains the 4-element bounded Boolean lattice with a simple quantifier, then it is finite-to-finite universal (in the categorical sense) and, as a consequence, for any monoid M, there exists a proper class of non-isomorphic algebras in V for which the endomorphism monoid of every member is isomorphic to M.

scholarly journals Prime Filters and Ideals in Distributive Lattices

2013 ◽  
Vol 21 (3) ◽  
pp. 213-221 ◽  
Author(s):  
Adam Grabowski
Keyword(s):  
Prime Ideal ◽  
Final Section ◽  
General Setting ◽  
Boolean Lattice ◽  
Boolean Algebras ◽  
Distributive Lattices ◽  
Prime Ideals ◽  
Binary Operations ◽  
The Common ◽  
Stone Representation

Summary. The article continues the formalization of the lattice theory (as structures with two binary operations, not in terms of ordering relations). In the Mizar Mathematical Library, there are some attempts to formalize prime ideals and filters; one series of articles written as decoding [9] proven some results; we tried however to follow [21], [12], and [13]. All three were devoted to the Stone representation theorem [18] for Boolean or Heyting lattices. The main aim of the present article was to bridge this gap between general distributive lattices and Boolean algebras, having in mind that the more general approach will eventually replace the common proof of aforementioned articles.1 Because in Boolean algebras the notions of ultrafilters, prime filters and maximal filters coincide, we decided to construct some concrete examples of ultrafilters in nontrivial Boolean lattice. We proved also the Prime Ideal Theorem not as BPI (Boolean Prime Ideal), but in the more general setting. In the final section we present Nachbin theorems [15],[1] expressed both in terms of maximal and prime filters and as the unordered spectra of a lattice [11], [10]. This shows that if the notion of maximal and prime filters coincide in the lattice, it is Boolean.

Beta dynamical systems over the formal fields

2014 ◽  
Vol 51 (4) ◽  
pp. 454-465
Author(s):  
Lu-Ming Shen ◽  
Huiping Jing
Keyword(s):  
Dynamical Systems ◽  
Finite Field ◽  
Haar Measure ◽  
Laurent Series ◽  
Formal Laurent Series ◽  
Almost All

Let \documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \usepackage{bbm} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$\mathbb{F}_q ((X^{ - 1} ))$$ \end{document} denote the formal field of all formal Laurent series x = Σ n=ν∞anX−n in an indeterminate X, with coefficients an lying in a given finite field \documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \usepackage{bbm} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$\mathbb{F}_q$$ \end{document}. For any \documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \usepackage{bbm} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$\beta \in \mathbb{F}_q ((X^{ - 1} ))$$ \end{document} with deg β > 1, it is known that for almost all \documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \usepackage{bbm} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$x \in \mathbb{F}_q ((X^{ - 1} ))$$ \end{document} (with respect to the Haar measure), x is β-normal. In this paper, we show the inverse direction, i.e., for any x, for almost all \documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \usepackage{bbm} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$\beta \in \mathbb{F}_q ((X^{ - 1} ))$$ \end{document}, x is β-normal.

L-Fuzzy Filters of Almost Distributive Lattices

2018 ◽  
Vol 8 (1) ◽  
pp. 35
Author(s):  
U. M. Swamy ◽  
Ch. Santhi Sundar Raj ◽  
A. Natnael Teshale
Keyword(s):  
Distributive Lattices ◽  
Fuzzy Filters

Prime O-Ideals of Distributive Lattices

2012 ◽  
Vol 2 (1) ◽  
pp. 1
Author(s):  
Mukkamala Sambasiva Rao
Keyword(s):  
Distributive Lattices

Valued Field Graph and Some Related Parameters

2020 ◽  
pp. 389-395
Author(s):  
G. Suresh Singh ◽  
P. K. Prasobha
Keyword(s):  
Finite Field ◽  
Independence Number ◽  
Valued Field ◽  
Vertex Set ◽  
Adic Valuation

Let $K$ be any finite field. For any prime $p$, the $p$-adic valuation map is given by $\psi_{p}:K/\{0\} \to \R^+\bigcup\{0\}$ is given by $\psi_{p}(r) = n$ where $r = p^n \frac{a}{b}$, where $p,a,b$ are relatively prime. The field $K$ together with a valuation is called valued field. Also, any field $K$ has the trivial valuation determined by $\psi{(K)} = \{0,1\}$. Through out the paper K represents $\Z_q$. In this paper, we construct the graph corresponding to the valuation map called the valued field graph, denoted by $VFG_{p}(\Z_{q})$ whose vertex set is $\{v_0,v_1,v_2,\ldots, v_{q-1}\}$ where two vertices $v_i$ and $v_j$ are adjacent if $\psi_{p}(i) = j$ or $\psi_{p}(j) = i$. Here, we tried to characterize the valued field graph in $\Z_q$. Also we analyse various graph theoretical parameters such as diameter, independence number etc.

ON n-MIXED PRODÜCT OF PSEUDOCOMPLEMENTED DISTRIBUTIVE LATTICES

1986 ◽  
Vol 19 (2) ◽  
Author(s):  
Lidia Sobolska
Keyword(s):  
Distributive Lattices ◽  
Mixed Product

On the Security of Public-Key Algorithms Based on Chebyshev Polynomials over the Finite Field $Z_N$

2010 ◽  
Vol 59 (10) ◽  
pp. 1392-1401 ◽  
Author(s):  
Xiaofeng Liao ◽  
Fei Chen ◽  
Kwok-wo Wong
Keyword(s):  
Finite Field ◽  
Chebyshev Polynomials ◽  
Public Key

Image encryption based on the finite field cosine transform

2013 ◽  
Vol 28 (10) ◽  
pp. 1537-1547 ◽  
Author(s):  
J.B. Lima ◽  
E.A.O. Lima ◽  
F. Madeiro
Keyword(s):  
Finite Field ◽  
Image Encryption ◽  
Cosine Transform
Sign in / Sign up

Export Citation Format

Share Document