Related papers: Successively almost positive links
We define extension maps as maps that extend a system (through adding ancillary systems) without changing the state in the original system. We show, using extension maps, why a completely positive operation on an initially entangled system…
The paper studies different variants of almost periodicity notion. We introduce the class of eventually strongly almost periodic sequences where some suffix is strongly almost periodic (=uniformly recurrent). The class of almost periodic…
Euclidean distance matrices corresponding to an arithmetic progression have rich spectral and structural properties. We exploit those properties to develop completely positive factorizations of translations of those matrices. We show that…
We consider transient nearest neighbor random walks on the positive part of the real line. We give criteria for the finiteness of the number of cutpoints and strong cutpoints. Examples and open problems are presented.
We introduce the notion of q-analogs of strongly regular graphs and give several examples of such structures. We prove a necessary condition on the parameters, show the connection to designs over finite fields, and present a classification.
Calculi of string diagrams are increasingly used to present the syntax and algebraic structure of various families of circuits, including signal flow graphs, electrical circuits and quantum processes. In many such approaches, the semantic…
An accessibility graph of a network contains a link, wherever there is a path of arbitrary length between two nodes. We generalize the concept of accessibility to temporal networks. Building an accessibility graph by consecutively adding…
We investigate straight-line drawings of topological graphs that consist of a planar graph plus one edge, also called almost-planar graphs. We present a characterization of such graphs that admit a straight-line drawing. The…
We develop a semigroup-theoretic analogue of liaison for relative ideals of a numerical semigroup. Two parallel linkage notions are proposed: a theory based on translates of the semigroup and a theory based on translates of the canonical…
The problem is addressed of defining the values of functions, whose variables tend to infinity, from the knowledge of these functions at asymptotically small variables close to zero. For this purpose, the extrapolation by means of different…
A perfect graph is a graph which every induced subgraph has clique number equal to chromatic number. In this paper, I will introduce a new family of graphs, the quasiperfect graphs which generalizes the perfect graphs.
A novel type of approximants is introduced, being based on the ideas of self-similar approximation theory. The method is illustrated by the examples possessing the structure typical of many problems in applied mathematics. Good numerical…
We construct an infinite family of links which are both almost alternating and quasi-alternating from a given either almost alternating diagram representing a quasi-alternating link, or connected and reduced alternating tangle diagram. To…
As an extension of the class of algebraic links, A'Campo, Gibson, and Ishikawa constructed links associated to immersed arcs and trees in a two-dimensional disk. By extending their arguments, we construct links associated to immersed graphs…
We introduce a general definition of almost $p$-summing mappings and give several concrete examples of such mappings. Some known results are considerably generalized and we present various situations in which the space of almost $p$-summing…
We revisit the classical question of the relationship between the diameter of a graph and its expansion properties. One direction is well understood: expander graphs exhibit essentially the lowest possible diameter. We focus on the reverse…
We provide a new and much simpler structure for quasi-ideal adequate transversals of abundant semigroups in terms of spined products, which is similar in nature to that given by Saito for weakly multiplicative inverse transversals of…
Many social, technological and biological interactions involve network relationships whose outcome intimately depends on the structure of the network and on the strengths of the connections. Yet, although much information is now available…
Several authors have introduced various type of coherent-like rings and proved analogous results on these rings. It appears that all these relative coherent rings and all the used techniques can be unified. In [2], several coherent-like…
Link prediction is one of the fundamental problems in network analysis. In many applications, notably in genetics, a partially observed network may not contain any negative examples of absent edges, which creates a difficulty for many…