Related papers: A characterization of a map whose inverse limit is…
We consider a family of inverse limits of inverse sequences of closed unit intervals with a single upper semi-continuous set-valued bonding function whose graph is an arc; it is the union of two line segments in $[0,1]^2$, both of them…
An arc is a set of vectors of the $k$-dimensional vector space over the finite field with $q$ elements ${\mathbb F}_q$, in which every subset of size $k$ is a basis of the space, i.e. every $k$-subset is a set of linearly independent…
A graph is circle if its vertices are in correspondence with a family of chords in a circle in such a way that every two distinct vertices are adjacent if and only if the corresponding chords have nonempty intersection. Even though there…
We \emph{propose} a new \emph{invariant} for a \emph{cycle} of an \emph{interval map} $f:[0,1] \to [0,1]$, called its \emph{unfolding number}.
We show that there is a point on a computable arc that does not belong to any computable rectifiable curve. We also show that there is a point on a computable rectifiable curve with computable length that does not belong to any computable…
We prove that the limit profile of a sequence of reversible Markov chains exhibiting total variation cutoff is a continuous function, under a computable condition involving the spectrum of the transition matrix and the cutoff window.
The contour of a family of filters along a filter is a set-theoretic lower limit. Topologicity and regularity of convergences can be characterized with the aid of the contour operation. Contour inversion is studied, in particular, for…
We generalize the class of split graphs to the directed case and show that these split digraphs can be identified from their degree sequences. The first degree sequence characterization is an extension of the concept of splittance to…
We consider continuous functions f : [0,1] \to R that cut the real axis at every point of a measurable set of positive measure and we construct examples where f fails to have bounded variation, and at the opposite end, where f admits…
We study the problem of Nadler and Quinn from 1972, which asks whether, given an arc-like continuum $X$ and a point $x \in X$, there exists an embedding of $X$ in $\mathbb{R}^2$ for which $x$ is an accessible point. We develop the notion of…
A RAC-drawing of a graph is a straight-line drawing in which every crossing occurs at a right-angle. We show that deciding whether a graph has a RAC-drawing is as hard as the existential theory of the reals, even if we know that every edge…
We study the space of arcs on a singularity of the form xy=f(z_1,..., z_n) and prove 2 main results. (i) The number of irreducible components equals the multiplicity of f minus 1. (ii) If n>1 and the leading homogeneous term of f is not a…
Let $A \in M_n(\C)$. We consider the mapping $f_A(x)=x^*Ax$, defined on the unit sphere in $\C^n$. The map has a multi-valued inverse $f_A^{-1}$, and the continuity properties of $f_A^{-1}$ are considered in terms of the structure of the…
The attracting set and the inverse limit set are important objects associated to a self-map on a set. We call \emph{stable set} of the self-map the projection of the inverse limit set. It is included in the attracting set, but is not equal…
A sequence of graphs is FO-convergent if the probability of satisfaction of every first-order formula converges. A graph modeling is a graph, whose domain is a standard probability space, with the property that every definable set is Borel.…
Metrizable spaces are studied in which every closed set is an $\alpha$-limit set for some continuous map and some point. It is shown that this property is enjoyed by every space containing sufficiently many arcs (formalized in the notion of…
We characterize the graphs with loops whose degree sequences have no repeated values and find their adjacency spectrum. In the case of simple graphs, such graphs are called anti-regular graphs and are examples of threshold graphs. The…
The Fourier transform is naturally defined for integrable functrions. Otherwise, it should be stipulated in which sense the Fourier transform is understood. We consider some class of radial and, generally saying, nonintegrable functions.…
A {\bf map} is a graph that admits an orientation of its edges so that each vertex has out-degree exactly 1. We characterize graphs which admit a decomposition into $k$ edge-disjoint maps after: (1) the addition of {\it any} $\ell$ edges;…
Let $n$ be a positive integer and $f$ a differentiable function from a convex subset $C$ of the Euclidean space $\mathbb{R}^n$ to a smooth manifold. We define an invariant of $f$ via counting certain threshold functions associated to $f$.…