The Lattice of Compatible Quasiorders of Acyclic Monounary Algebras

Acyclic monounary algebras are characterized by the property that any compatible partial order r can be extended to a compatible linear order. In the case of rooted monounary algebras A=(A,f){\cal A}=(A,f) we characterize the intersection of compatible linear extensions of r by several equivalent conditions and generalize these results to compatible quasiorders of A{\cal A}. We show that the lattice QuordA{\rm{Quord}}{\cal A} of compatible quasiorders is a disjoint union of semi-intervals whose maximal elements equal the intersection of their compatible quasilinear extensions. We also investigate algebraic properties of the lattices QuordA{\rm{Quord}}{\cal A} and ConA{\rm{Con}}{\cal A}.     

Convexities of partial monounary algebras

In the present paper we prove that the collection of all convexities of partial monounary algebras is finite; namely, it has exactly 23 elements. Further, we show that for each element there exists a subset of such that is generated by and card . This work was supported by the Science and Technology Assistance Agency under the contract No. APVT-20-004104. Supported by Grant VEGA 1/3003/06.     

The lattice of congruence lattices of algebras on a finite set

The congruence lattices of all algebras defined on a fixed finite set A ordered by inclusion form a finite atomistic lattice \(\mathcal {E}\). We describe the atoms and coatoms. Each meet-irreducible element of \(\mathcal {E}\) being determined by a single unary mapping on A, we characterize completely those which are determined by a permutation or by an acyclic mapping on the set A. Using these characterisations we deduce several properties of the lattice \(\mathcal {E}\); in particular, we prove that \(\mathcal {E}\) is tolerance-simple whenever \(|A|\ge 4\).     

The lattice of convexities of partial monounary algebras

A class of partial monounary algebras is called a convexity if it is closed under homomorphic images, direct products and convex relative subalgebras. We prove that the collection of all convexities of partial monounary algebras forms a countable set. Further, each convexity can be generated by at most two algebras.     

Estimation error for occupation time functionals of stationary Markov processes

The approximation of integral functionals with respect to a stationary Markov process by a Riemann sum estimator is studied. Stationarity and the functional calculus of the infinitesimal generator of the process are used to explicitly calculate the estimation error and to prove a general finite sample error bound. The presented approach admits general integrands and gives a unifying explanation for different rates obtained in the literature. Several examples demonstrate how the general bound can be related to well-known function spaces.     

Assessing Similarity of Random sets via Skeletons

Methodology and Computing in Applied Probability - The paper concerns a method for assessing similarity of realisations of random sets based on a construction of their morphological skeletons and a...     

Solvability of the power flow problem in DC overhead wire circuit modeling

Applications of Mathematics - Proper traffic simulation of electric vehicles, which draw energy from overhead wires, requires adequate modeling of traction infrastructure. Such vehicles include...     

Generalized Specker lattice-ordered groups and two types of distributivity

Let A be a lattice-ordered group, B a generalized Boolean algebra. The Boolean extension A _B of A has been investigated in the literature; we will refer to A _B as a generalized Specker lattice-ordered group (namely, if A is the linearly ordered group of all integers, then A _B is a Specker lattice-ordered group). The paper establishes that some distributivity laws extend from A _B to both A and B, and (under certain circumstances) also conversely.     

Weak relatively uniform convergences on MV-algebras

Weak relatively uniform convergences (wru-convergences, for short) in lattice ordered groups have been investigated in previous authors’ papers. In the present article, the analogous notion for MV-algebras is studied. The system s(A) of all wru-convergences on an MV-algebra A is considered; this system is partially ordered in a natural way. Assuming that the MV-algebra A is divisible, we prove that s(A) is a Brouwerian lattice and that there exists an isomorphism of s(A) into the system s(G) of all wru-convergences on the lattice ordered group G corresponding to the MV-algebra A. Under the assumption that the MV-algebra A is archimedean and divisible, we investigate atoms and dual atoms in the system s(A).     

Triangle-Free Geometric Intersection Graphs with Large Chromatic Number

Several classical constructions illustrate the fact that the chromatic number of a graph may be arbitrarily large compared to its clique number. However, until very recently no such construction was known for intersection graphs of geometric objects in the plane. We provide a general construction that for any arc-connected compact set $X$ X in $\mathbb{R }^2$ R 2 that is not an axis-aligned rectangle and for any positive integer $k$ k produces a family $\mathcal{F }$ F of sets, each obtained by an independent horizontal and vertical scaling and translation of $X$ X , such that no three sets in $\mathcal{F }$ F pairwise intersect and $\chi (\mathcal{F })>k$ χ ( F ) > k . This provides a negative answer to a question of Gyárfás and Lehel for L-shapes. With extra conditions we also show how to construct a triangle-free family of homothetic (uniformly scaled) copies of a set with arbitrarily large chromatic number. This applies to many common shapes, like circles, square boundaries or equilateral L-shapes. Additionally, we reveal a surprising connection between coloring geometric objects in the plane and on-line coloring of intervals on the line.