Related papers: Bands in partially ordered vector spaces with orde…
A chord diagram consists of a circle, called the backbone, with line segments, called chords, whose endpoints are attached to distinct points on the circle. The genus of a chord diagram is the genus of the orientable surface obtained by…
We define what is meant by a strict total order in a category having subobjects, products and fibre products. This allows us to define the notions of an ordered bundle X and an ordered G-set; when G=\pi_1(X) we relate these structures to…
We study the number of connected graphs with $n$ vertices that cannot be written as the cartesian product of two graphs with fewer vertices. We give an upper bound which implies that for large $n$ almost all graphs are both connected and…
It is consistent that there is a partial order (P,<) of size aleph_1 such that every monotone (unary) function from P to P is first order definable in (P,<). The partial order is constructed in an extension obtained by finite support…
We demonstrate the existence of a uniform and nonhomogeneous vector bundle $E$ of rank $(n-d)(m+1)-1$ over Grassmannian $\mathbb{G}(d,n)$, where $m>d$ and $1\le d \le n-d-1$ with a $\mathbb{P}$-homogeneity degree $h(E)=d$. Particularly, we…
A random graph order is a partial order obtained from a random graph on $[n]$ by taking the transitive closure of the adjacency relation. The dimension of the random graph orders from random bipartite graphs $B(n,n,p)$ and from $G(n,p)$…
Gromov's band-width conjecture gives a precise upper bound for the width of a compact Riemannian band with positive scalar curvature lower bound, assuming that the cross-section of the band admits no positive scalar curvature metrics.…
We explore "semibounded" expansions of arbitrary ordered groups; namely, expansions that do not define a field on the whole universe. We show that if $\mathcal R=\langle R, <, +, \dots\rangle$ is a semibounded o-minimal structure and…
We describe how self-adjoint ordered operator spaces, also called non-unital operator systems in the literature, can be understood as $*$-vector spaces equipped with a matrix gauge structure. We explain how this perspective has several…
We show that a proper algebraic n-dimensional scheme Y admits nontrivial vector bundles of rank n, even if Y is non-projective, provided that there is a modification containing a projective Cartier divisor that intersects the exceptional…
Projections onto several special subsets in the Dedekind complete vector lattice of orthogonally additive, order bounded (called abstract Uryson) operators between two vector lattices $E$ and $F$ are considered and some new formulas are…
In a reduction sequence of a graph, vertices are successively identified until the graph has one vertex. At each step, when identifying $u$ and $v$, each edge incident to exactly one of $u$ and $v$ is coloured red. Bonnet, Kim, Thomass\'e…
We study superconductivity in the Hubbard model on various quasi-one-dimensional lattices with coexisting wide and narrow bands originating from multiple sites within a unit cell, where each site corresponds to a single orbital. The systems…
Canonical orderings serve as the basis for many incremental planar drawing algorithms. All these techniques, however, have in common that they are limited to undirected graphs. While $st$-orderings do extend to directed graphs, especially…
In this paper, we define and study the space of all the functions of bounded variation $f:[x,y]\to \mathbb{Y}$ denoted by $\mathcal{BV}[x,y],$ where $[x,y]$ is an ordered interval and $\mathbb{Y}$ is an absolute order unit space having…
We prove that the order of the canonical vector bundle over the configuration space is $2$ for a general planar graph, and is $4$ for a nonplanar graph.
We determine the number of labelled chordal planar graphs with $n$ vertices, which is asymptotically $c_1\cdot n^{-5/2} \gamma^n n!$ for a constant $c_1>0$ and $\gamma \approx 11.89235$. We also determine the number of rooted simple chordal…
Banded bounded matrices, which represent non normal operators, of oscillatory type that admit a positive bidiagonal factorization are considered. To motivate the relevance of the oscillatory character the Favard theorem for Jacobi matrices…
We study the planar orthogonal drawing style within the framework of partial representation extension. Let $(G,H,{\Gamma}_H )$ be a partial orthogonal drawing, i.e., G is a graph, $H\subseteq G$ is a subgraph and ${\Gamma}_H$ is a planar…
For a graph $G$, let $\sigma_{2}(G)$ be the minimum degree sum of two non-adjacent vertices in $G$. A chord of a cycle in a graph $G$ is an edge of $G$ joining two non-consecutive vertices of the cycle. In this paper, we prove the following…