Related papers: A characterization of a map whose inverse limit is…
For any fixed integer $R \geq 2$ we characterise the typical structure of undirected graphs with vertices $1, ..., n$ and maximum degree $R$, as $n$ tends to infinity. The information is used to prove that such graphs satisfy a labelled…
Let $K$ be the graph on vertices $\{1, 2, 3, 4, 5\}$, and having all edges except $(4, 5)$. A continuous map $f:K\to \R^2$ is called an \emph{almost embedding} if $f$-images of non-adjacent edges are disjoint. Take the winding numbers of…
We introduce the notion of indivisible sequences and show that to any indivisible sequence $\{S, \Psi: S \to R\}$ we can associate faithfully flat ring maps $R \to R'$ that are not descendable. As a corollary, we obtain the first example of…
We characterize all bounded Hankel operators $\Gamma $ such that $\Gamma^*\Gamma$ has finite spectrum. We identify spectral data corresponding to such operators and construct inverse spectral theory including the characterization of these…
It is known that if f is a continuous function on the complex plane which extends holomorphically from each circle surrounding the origin then f is not necessarily holomorphic. In the paper we prove that if, in addition, f extends…
A graph is called dominating if its vertices can be labelled with integers in such a way that for every function f: omega-> omega the graph contains a ray whose sequence of labels eventually exceeds f. We obtain a characterization of these…
In ``Rips complexes and covers in the uniform category'' the authors define, following James, covering maps of uniform spaces and introduce the concept of generalized uniform covering maps. Conditions for the existence of universal uniform…
One distinguishing feature of rational curves is that they have algebraic parameterizations. Arc spaces are a way of describing approximations to parameterizations of all curves in some fixed space. Playing on these descriptions, this paper…
An \emph{arithmetic read-once formula} (ROF for short) is a formula (i.e. a tree of computation) in which the operations are $\{+,\times\}$ and such that every input variable labels at most one leaf. We give a simple characterization of…
A graph G is an a-angle crossing (aAC) graph if every pair of crossing edges in G intersect at an angle of at least a. The concept of right angle crossing (RAC) graphs (a=Pi/2) was recently introduced by Didimo et. al. It was shown that any…
The matrix inversion is an interesting topic in algebra mathematics. However, to determine an inverse matrix from a given matrix is required many computation tools and time resource if the size of matrix is huge. In this paper, we have…
A graph is circle if there is a family of chords in a circle such that two vertices are adjacent if the corresponding chords cross each other. There are diverse characterizations of circle graphs, many of them using the notions of local…
We examine the notion of anticonfinement and the role it has to play in the singularity analysis of discrete systems. A singularity is said to be anticonfined if singular values continue to arise indefinitely for the forward and backward…
It is shown that the projection image of an oriented spatial arc to any oriented plane is approximated by a unique arc diagram (up to isomorphic arc diagrams) determined from the spatial arc and the projection. In a separated paper, the…
It is proved that the C*-algebra of a graph is residually finite dimensional (RFD) if and only if the graph has no infinite receiver, no cycle with an exit, no infinite ackward chain and from each vertex, there is a finite path to a sink or…
We construct a function on the real line supported on a set of finite measure whose spectrum has density zero.
The vertex-edge incidence matrix of a (connected) unicyclic graph G is a square matrix which is invertible if and only if the cycle of G is an odd cycle. A combinatorial formula of the inverse of the incidence matrix of an odd unicyclic…
Given a function f in the exterior of a convex curve in the real plane, we prove that if the restrictions of f to the tangent lines to the curve extend as entire functions, then the function f is an entire function of two variables.
In this paper we present an equivalent statement to the Jacobian conjecture. For a polynomial map F on an affine space of dimension n, we define recursively n finite sequences of polynomials. We give an equivalent condition to the…
For a smooth expanding map $f$ of the circle, its (unmarked) length spectrum is defined as the set of logarithms of multipliers of periodic orbits of $f$. This spectrum is analogous to the set of lengths of all closed geodesics on…