scholarly journals Lattice Representations with Set Partitions Induced by Pairings

10.37236/8786 ◽  
2020 ◽  
Vol 27 (1) ◽  
Author(s):  
Giampiero Chiaselotti ◽  
Tommaso Gentile ◽  
Federico Infusino

We call a quadruple $\mathcal{W}:=\langle F,U,\Omega,\Lambda \rangle$, where $U$ and $\Omega$ are two given non-empty finite sets, $\Lambda$ is a non-empty set and $F$ is a map having domain $U\times \Omega$ and codomain $\Lambda$, a pairing on $\Omega$. With this structure we associate a set operator $M_{\mathcal{W}}$ by means of which it is possible to define a preorder $\ge_{\mathcal{W}}$ on the power set $\mathcal{P}(\Omega)$ preserving set-theoretical union. The main results of our paper are two representation theorems. In the first theorem we show that for any finite lattice $\mathbb{L}$ there exist a finite set $\Omega_{\mathbb{L}}$ and a pairing $\mathcal{W}$ on $\Omega_\mathbb{L}$ such that the quotient of the preordered set $(\mathcal{P}(\Omega_\mathbb{L}), \ge_\mathcal{W})$ with respect to its symmetrization is a lattice that is order-isomorphic to $\mathbb{L}$. In the second result, we prove that when the lattice $\mathbb{L}$ is endowed with an order-reversing involutory map $\psi: L \to L$ such that $\psi(\hat 0_{\mathbb{L}})=\hat 1_{\mathbb{L}}$, $\psi(\hat 1_{\mathbb{L}})=\hat 0_{\mathbb{L}}$, $\psi(\alpha) \wedge \alpha=\hat 0_{\mathbb{L}}$ and $\psi(\alpha) \vee \alpha=\hat 1_{\mathbb{L}}$, there exist a finite set $\Omega_{\mathbb{L},\psi}$ and a pairing on it inducing a specific poset which is order-isomorphic to $\mathbb{L}$.

1956 ◽  
Vol 21 (3) ◽  
pp. 304-308 ◽  
Author(s):  
H. G. Rice

The two results of this paper (a theorem and an example) are applications of a device described in section 1. Our notation is that of [4], with which we assume familiarity. It may be worth while to mention in particular the function Φ(n, x) which recursively enumerates the partial recursive functions of one variable, the Cantor enumerating functions J(x, y), K(x), L(x), and the classes F and Q of r.e. (recursively enumerable) and finite sets respectively.It is possible to “give” a finite set in a way which conveys the maximum amount of information; this may be called “giving explicitly”, and it requires that in addition to an effective enumeration or decision procedure for the set we give its cardinal number. It is sometimes desired to enumerate effectively an infinite class of finite sets, each given explicitly (e.g., [4] p. 360, or Dekker [1] p. 497), and we suggest here a device for doing this.We set up an effective one-to-one correspondence between the finite sets of non-negative integers and these integers themselves: the integer , corresponds to the set αi, = {a1, a2, …, an} and inversely. α0 is the empty set. Clearly i can be effectively computed from the elements of αi and its cardinal number.


Author(s):  
Joaquín Moraga

Abstract In this article, we prove a local implication of boundedness of Fano varieties. More precisely, we prove that $d$ -dimensional $a$ -log canonical singularities with standard coefficients, which admit an $\epsilon$ -plt blow-up, have minimal log discrepancies belonging to a finite set which only depends on $d,\,a$ and $\epsilon$ . This result gives a natural geometric stratification of the possible mld's in a fixed dimension by finite sets. As an application, we prove the ascending chain condition for minimal log discrepancies of exceptional singularities. We also introduce an invariant for klt singularities related to the total discrepancy of Kollár components.


1976 ◽  
Vol 15 (2) ◽  
pp. 245-251
Author(s):  
Reinhard A. Razen

Let A = {ai} be a finite set of integers and let p and m denote the cardinalities of A + A = {ai+aj} and A - A {ai–aj}, respectively. In the paper relations are established between p and m; in particular, if max {ai–ai-1} = 2 those sets are characterized for which p = m holds.


1995 ◽  
Vol 52 (2) ◽  
pp. 215-224 ◽  
Author(s):  
Hong-Xun Yi

In 1976, Gross posed the question “can one find two (or possibly even one) finite sets Sj (j = 1, 2) such that any two entire functions f and g satisfying Ef(Sj) = Eg(Sj) for j = 1,2 must be identical?”, where Ef(Sj) stands for the inverse image of Sj under f. In this paper, we show that there exists a finite set S with 11 elements such that for any two non-constant meromorphic functions f and g the conditions Ef(S) = Eg(S) and Ef({∞}) = Eg({∞}) imply f ≡ g. As a special case this also answers the question posed by Gross.


1977 ◽  
Vol 17 (1) ◽  
pp. 125-134 ◽  
Author(s):  
Peter Frankl
Keyword(s):  

Let X be a finite set of cardinality n, and let F be a family of k-subsets of X. In this paper we prove the following conjecture of P. Erdös and V.T. Sós.If n > n0(k), k ≥ 4, then we can find two members F and G in F such that |F ∩ G| = 1.


2004 ◽  
Vol 69 (2) ◽  
pp. 289-295 ◽  
Author(s):  
M. I. Ostrovskii

One of the important problems of the local theory of Banach Spaces can be stated in the following way. We consider a condition on finite sets in normed spaces that makes sense for a finite set any cardinality. Suppose that the condition is such that to each set satisfying it there corresponds a constant describing “how well” the set satisfies the condition.The problem is:Suppose that a normed space X has a set of large cardinality satisfying the condition with “poor” constant. Does there exist in X a set of smaller cardinality satisfying the condition with a better constant?In the paper this problem is studied for conditions associated with one of R.C. James's characterisations of superreflexivity.


2010 ◽  
Vol 18 (4) ◽  
pp. 197-200
Author(s):  
Cezary Kaliszyk

Counting Derangements, Non Bijective Functions and the Birthday Problem The article provides counting derangements of finite sets and counting non bijective functions. We provide a recursive formula for the number of derangements of a finite set, together with an explicit formula involving the number e. We count the number of non-one-to-one functions between to finite sets and perform a computation to give explicitely a formalization of the birthday problem. The article is an extension of [10].


2004 ◽  
Vol 35 (4) ◽  
pp. 351-358
Author(s):  
Pier Luigi Papini

In this paper we consider finite sets in a normed, infinite dimensional space. First, we study the following problem: given a finite set $F$, does there exist a sphere containing $F$ on its surface? We indicate some results and we collect some examples concerning this problem, also for sets of small cardinality. Then we give an example of a three-point set, in a Hilbert space, without incenter.


Author(s):  
Asaf Karagila ◽  
Philipp Schlicht

Cohen’s first model is a model of Zermelo–Fraenkel set theory in which there is a Dedekind-finite set of real numbers, and it is perhaps the most famous model where the Axiom of Choice fails. We force over this model to add a function from this Dedekind-finite set to some infinite ordinal κ . In the case that we force the function to be injective, it turns out that the resulting model is the same as adding κ Cohen reals to the ground model, and that we have just added an enumeration of the canonical Dedekind-finite set. In the case where the function is merely surjective it turns out that we do not add any reals, sets of ordinals, or collapse any Dedekind-finite sets. This motivates the question if there is any combinatorial condition on a Dedekind-finite set A which characterises when a forcing will preserve its Dedekind-finiteness or not add new sets of ordinals. We answer this question in the case of ‘Adding a Cohen subset’ by presenting a varied list of conditions each equivalent to the preservation of Dedekind-finiteness. For example, 2 A is extremally disconnected, or [ A ] < ω is Dedekind-finite.


1975 ◽  
Vol 19 (1) ◽  
pp. 35-46 ◽  
Author(s):  
G. P. Monro

A Dedekind-finite set is one not equinumerous with any of its proper subsets; it is well known that the axiom of choice implies that all such sets are finite. In this paper we show that in the absence of the axiom of choice it is possible to construct Dedekind-finite sets which are large, in the sense that they can be mapped onto large ordinals; we extend the result to proper classes. It is also shown that the axiom of choice for countable sets is not implied by the assumption that all Dedekind-finite sets are finite.


Sign in / Sign up

Export Citation Format

Share Document