Related papers: Linear orderings of combinatorial cubes
We briefly discuss linear algebraic, combinatorial, and applied aspects of an exact model representation of binary arrays. As an illustration, we present two linear algebraic portraits of a string of characters.
Competing inhomogeneous orders are a central feature of correlated electron materials including the high-temperature superconductors. The two- dimensional Hubbard model serves as the canonical microscopic physical model for such systems.…
We study the relation on linear orders induced by order preserving surjections. In particular we show that its restriction to countable orders is a bqo.
We study the finite satisfiability problem for the two-variable fragment of first-order logic extended with counting quantifiers (C2) and interpreted over linearly ordered structures. We show that the problem is undecidable in the case of…
Every left-invariant ordering of a group is either discrete, meaning there is a least element greater than the identity, or dense. Corresponding to this dichotomy, the spaces of left, Conradian, and bi-orderings of a group are naturally…
It is shown that for any Baire space $X$, linearly ordered compact $Y$ and separately continuous mapping $f:X\times Y\to\mathbb R$ there exists a dense in $X$ $G_\delta$-set $A\subseteq X$ such that $f$ is jointly continuous at every point…
Given a pseudoword over suitable pseudovarieties, we associate to it a labeled linear order determined by the factorizations of the pseudoword. We show that, in the case of the pseudovariety of aperiodic finite semigroups, the pseudoword…
We prove that the lexicographic, degree lexicographic and the degree reverse lexicographic orders for monomials in $R_n=K[X_1,...X_n]$ are uniquely determined by their induced orderings, (i.e. their restrictions to $R_{n,i}=K[X_1,...,…
In the present note we study some arrangements of inflectional lines, hyperosculating conics, and a nodal plane cubic that are free. Moreover, we study weak combinatorics of arrangements consisting of lines, conics, and elliptic curves…
A Hamilton decomposition of a graph is a partitioning of its edge set into disjoint spanning cycles. The existence of such decompositions is known for all hypercubes of even dimension $2n$. We give a decomposition for the case $n = 2^a3^b$…
Algorithmic decidability is established for two order-theoretic properties of downward closed subsets defined by finitely many obstructions in two infinite posets. The properties under consideration are: (a) being atomic, i.e. not being…
Given a morphism of (small) groupoids with injective object map, we provide sufficient and necessary conditions under which the induction and co-induction functors between the categories of linear representations are naturally isomorphic. A…
Following the programme set out in Part I of this work, we develop a conceptual higher order differential calculus. The '' local linear algebra '' defined in Part I is generalized by '' higher order local linear algebra ''. The underlying…
An ordered graph $G_<$ is a graph with a total ordering $<$ on its vertex set. A monotone path of length $k$ is a sequence of vertices $v_1<v_2<\ldots<v_k$ such that $v_iv_{j}$ is an edge of $G_<$ if and only if $|j-i|=1$. A bi-clique of…
We prove that every finite poset has a directed cut with at least one half of the poset's pairwise order relations. The bound is tight. Also, the largest directed cut in a poset can be found in linear time.
This paper considers completions of COMs (complexes oriented matroids) to ample partial cubes of the same VC-dimension. We show that these exist for OMs (oriented matroids) and CUOMs (complexes of uniform oriented matroids). This implies…
In the List $k$-Coloring problem we are given a graph whose every vertex is equipped with a list, which is a subset of $\{1,\ldots,k\}$. We need to decide if $G$ admits a proper coloring, where every vertex receives a color from its list.…
We show a general result known as the Erdos_Sos Conjecture: if $E(G)>{1/2}(k-1)n$ where $G$ has order $n$ then $G$ contains every tree of order $k+1$ as a subgraph.
A linearly ordered (LO) $k$-colouring of a hypergraph assigns to each vertex a colour from the set $\{0,1,\ldots,k-1\}$ in such a way that each hyperedge has a unique maximum element. Barto, Batistelli, and Berg conjectured that it is…
A \emph{$k$--bisection} of a bridgeless cubic graph $G$ is a $2$--colouring of its vertex set such that the colour classes have the same cardinality and all connected components in the two subgraphs induced by the colour classes have order…