Related papers: Copies of Monomorphic Structures
Every partial applicative structure gives rise to an indexed binary relation, that is a contravariant functor from the category of sets to the category of sets endowed with binary relations and maps preserving them. In this paper we…
We present a system of relational syllogistic, based on classical propositional logic, having primitives of the following form: Some A are R-related to some B; Some A are R-related to all B; All A are R-related to some B; All A are…
The support poset of a monomial ideal $I\subseteq\mathbf{k}[x_1,\dots,x_n]$ encodes the relation between the variables $x_1,\dots,x_n$ and the minimal monomial generators of $I$. It is known that not every poset is realizable as the support…
We introduce several highness notions on degrees related to the problem of computing isomorphisms between structures, provided that isomorphisms exist. We consider variants along axes of uniformity, inclusion of negative information, and…
We present a structural approach of some results about jumps in the behavior of the profile (alias generating function) of hereditary classes of finite structures. We start with the following notion due to N.Thi\'ery and the second author.…
A sectionally pseudocomplemented poset P is one which has the top element and in which every principal order filter is a pseudocomplemented poset. The sectional pseudocomplements give rise to an implication-like operation on P which…
A collection of simple closed curves in $\rr^3$ is called a negative slice if it is the intersection of a flat-at-infinity planar Lagrangian surface and $\{y_2 = a \}$ for some $a < 0$. Examples and non-examples of negative slices are…
We present an example of two countable $\omega$-categorical structures, one of which has a finite relational language, whose endomorphism monoids are isomorphic as abstract monoids, but not as topological monoids -- in other words, no…
A topological space $L$ is called a linear ordered topological space (LOTS) whenever there is a linear order $\leq$ on $L$ such that the topology on $L$ is generated by the open sets of the form $(a, b)$ with $a < b$ and $a, b \in L \cup \{…
Each relational structure X has an associated Gaifman graph, which endows X with the properties of a graph. Suppose that X is infinite, connected and of bounded degree. A first-order sentence in the language of X is almost surely true…
In this paper, we define a new structure analogous to group, called partial group. This structure concerns the partial stability by the composition inner law. We generalize the three isomorphism theorems for groups to partial groups.
Topologies $\tau , \sigma \in \mathop{{\mathrm{Top}}}\nolimits _X$ are bijectively related, in notation $\tau \sim \sigma$, if there are continuous bijections $f: (X, \tau )\rightarrow (X, \sigma )$ and $g: (X, \sigma)\rightarrow (X,…
A coarse space $X$, endowed with a linear order compatible with the coarse structure of $X$, is called linearly ordered. We prove that every linearly ordered coarse space $X$ is locally convex and the asymptotic dimension of $X$ is either…
We present a matrix-theoretic approach for studying and enumerating finite posets through their incidence representations, referred to as poset matrices. Naturally labelled posets are encoded as Boolean lower triangular matrices, allowing a…
A shelf is a set with a binary operation~$\op$ satisfying $a \op (b \op c) = (a \op b) \op (a \op c)$. Racks are shelves with invertible translations $b \mapsto a \op b$; many of their aspects, including cohomological, are better understood…
An $\omega$-tree-automatic structure is a relational structure whose domain and relations are accepted by Muller or Rabin tree automata. We investigate in this paper the isomorphism problem for $\omega$-tree-automatic structures. We prove…
A structure is called homogeneous if every isomorphism between finitely induced substructures of the structure extends to an automorphism of the structure. Recently, P. J. Cameron and J. Ne\v{s}et\v{r}il introduced a relaxed version of…
We consider hierarchical structures such as Fibonacci sequences and Penrose tilings, and examine the consequences of different choices for the definition of isomorphism. In particular we discuss the role such a choice plays with regard to…
Building on previous work of [BPS] we investigate $\sigma$-closed partial orders of size continuum. We provide both an internal and external characterization of such partial orders by showing that (1) every $\sigma$-closed partial order of…
For any length category, we establish a set of rules (necessary and sufficient) that ensure a partial order on the isomorphism classes of simple objects such that the category is equivalent to the category of finite dimensional…