Related papers: Iterates of mappings which are almost continuous a…
We construct a family of growing finite bounded degree rooted graphs, $G_n$, in which the mixing time for simple random walk, starting at the root, is order $\log |G_n|$. Yet after a quasi - isometry, the ratio of $|G_n|$ over the mixing…
A new approach to find all the transitive orientations for a comparability graph (finite or infinite) is presented. This approach is based on the link between the notion of ``strong'' partitive set and the forcing theory (notions of…
We study a class of chainable continua which contains, among others, all inverse limit spaces generated by a single interval bonding map which is piecewise monotone and locally eventually onto. Such spaces are realized as attractors of…
We give an example of a sequential dynamical system consisting of intermittent-type maps which exhibits loss of memory with a polynomial rate of decay. A uniform bound holds for the upper rate of memory loss. The maps may be chosen in any…
We present a form of algebraic reasoning for computational objects which are expressed as graphs. Edges describe the flow of data between primitive operations which are represented by vertices. These graphs have an interface made of…
We propose a novel method for planning shortest length piecewise-linear motions through complex environments punctured with static, moving, or even morphing obstacles. Using a moment optimization approach, we formulate a hierarchy of…
We characterize the smallest finite spaces with the same homotopy groups of the spheres. Similarly, we describe the minimal finite models of any finite graph. We also develop new combinatorial techniques based on finite spaces to study…
We describe a general procedure to construct topological extensions of given skew product maps with one-dimensional fibres, by blowing up a countable number of single points to vertical segments. This allows to produce various examples of…
We show how to construct a topological Markov map of the interval whose invariant probability measure is the stationary law of a given stochastic chain of infinite order. In particular we caracterize the maps corresponding to stochastic…
The scope of the paper is the theoretical analysis of the time rate in which a dynamical system reaches a stable stationary state or stable oscillations. The method used for the analysis is based on the so-called iterative time profiles,…
We study the possibility of a continuous extension of a class of mappings to an isolated point on the boundary of a domain. We show that if some characteristic of this mapping is integrable on almost all spheres in the neighborhood of at…
Let $f \colon X \rightarrow Y$ be a resolvable-measurable mapping of a metrizable space $X$ to a regular space $Y$. Then $f$ is piecewise continuous. Additionally, for a metrizable completely Baire space $X$, it is proved that $f$ is…
We provide necessary and sufficient conditions for a set-valued mapping between finite dimensional spaces to be directionally open by relating this property with directional regularity, H\"older continuity of the inverse mapping,…
We study open-closed discrete mappings that satisfy the weighted estimate of the distortion of modulus of families of paths. It is proved that the mappings mentioned above have a continuous extension into the isolated point of the boundary,…
Frequent itemsets form a polytope and can be found and analyzed with Linear Programming.
We provide in a unified way quantitative forms of strong convergence results for numerous iterative procedures which satisfy a general type of Fejer monotonicity where the convergence uses the compactness of the underlying set. These…
In the last years a lot of work has been concentrated on the study of the behaviour at infinity of polynomial maps. This behaviour can be very complicated, therefore the main idea was to find special classes of polynomial maps which have,…
We consider a modified notion of planarity, in which two nations of a map are considered adjacent when they share any point of their boundaries (not necessarily an edge, as planarity requires). Such adjacencies define a map graph. We give…
A matching in a graph is uniquely restricted if no other matching covers exactly the same set of vertices. We establish tight lower bounds on the maximum size of a uniquely restricted matching in terms of order, size, and maximum degree.
This document is an exposition of an assortment of open problems arising from the exact enumeration of (perfect) matchings of finite graphs. Roughly half have been solved at the time of this writing; see the document "Twenty Open Problems…