Related papers: Linear orders on chainable continua
We study filter based regularization methods for linear ill-posed problems between Hilbert spaces. We derive optimal order conditions under a-priori choice rules for the regularization parameter. Such analysis is applied to the fractional…
Consider a sequence of LexBFS vertex orderings {\sigma}1, {\sigma}2, . . . where each ordering {\sigma}i is used to break ties for {\sigma}i+1. Since the total number of vertex orderings of a finite graph is finite, this sequence must end…
In this paper we demonstrate that it is consistent, relative to the existence of a supercompact cardinal, that there is no linear order which is minimal with respect to being non $\sigma$-scattered. This shows that a theorem of Laver, which…
We solve the center-focus problem in a class of piecewise quadratic polynomial differential systems with an invariant straight line. The separation curve is also a straight line which is not invariant. We provide families having at the…
We construct non-isomorphic linear orders X and Y that are both left-hand and right-hand divisors of one another, answering positively a question of Sierpinski.
Ordered phases on curved substrates experience a complex interplay of ordering and intrinsic curvature, commonly producing frustration and singularities. This is an especially important issue in crystals as ever-smaller scale materials are…
We prove that a continuum $X$ is tree-like (resp. circle-like, chainable) if and only if for each open cover $\U_4=\{U_1,U_2,U_3,U_4\}$ of $X$ there is a $\U_4$-map $f:X\to Y$ onto a tree (resp. onto the circle, onto the interval). A…
The directions of an infinite graph $G$ are a tangle-like description of its ends: they are choice functions that choose compatibly for all finite vertex sets $X\subseteq V(G)$ a component of $G-X$. Although every direction is induced by a…
For a countable ultrahomogeneous graph G let P(G) denote the collection of domains of subgraphs of G isomorphic to G. The order types of maximal chains in the set P(G) U {\o} ordered by the inclusion are characterized as: (I) the order…
Linearly repetitive cut and project sets are mathematical models for perfectly ordered quasicrystals. In a previous paper we presented a characterization of linearly repetitive cut and project sets. In this paper we extend the classical…
In various places in the literature it is stated that every separable linear order embeds into the real line. This is, however, not the case, at least not with respect to the usual definition of separability. We correct this misconception.
Measuring how quickly iterative methods converge is essential in computational mathematics, but current approaches have significant limitations. Q-order analysis requires strict smoothness conditions, while R-order analysis lacks precision…
Order-invariant formulas access an ordering on a structure's universe, but the model relation is independent of the used ordering. Order invariance is frequently used for logic-based approaches in computer science. Order-invariant formulas…
Given a Schauder basic sequence $(x_k)$ in a Banach lattice, we say that $(x_k)$ is bibasic if the expansion of every vector in $[x_k]$ converges not only in norm, but also in order. We prove that, in this definition, order convergence may…
A filter $\F$ on $\w$ is called Fr\'echet-Urysohn if the space with only one non-isolated point $\w \cup \{\F\}$ is a Fr\'echet-Urysohn space, where the neighborhoods of the non-isolated point are determined by the elements of $\F$. In this…
Anusic, Bruin, and Cinc have asked which hereditarily decomposable chainable continua (HDCC) have uncountably many mutually inequivalent planar embeddings. It was noted, as per the embedding technique of John C. Mayer with the…
We present some new results on union ultrafilters. We characterize stability for union ultrafilters and, as the main result, we construct a new kind of unordered union ultrafilter.
This article deals with the second order linear differential equations with entire coefficients. We prove some results involving conditions on coefficients so that the order of growth of every non-trivial solution is infinite.
A causal set is a partially ordered set on a countably infinite ground-set such that each element is above finitely many others. A natural extension of a causal set is an enumeration of its elements which respects the order. We bring…
Linearizability is the commonly accepted notion of correctness for concurrent data structures. It requires that any execution of the data structure is justified by a linearization --- a linear order on operations satisfying the data…