Related papers: On streams that are finitely red
We introduce an operational rewriting-based semantics for strictly positive nested higher-order (co)inductive types. The semantics takes into account the "limits" of infinite reduction sequences. This may be seen as a refinement and…
Subject of research is complex networks and network systems. The network system is defined as a complex network in which flows are moved. Classification of flows in the network is carried out on the basis of ordering and continuity. It is…
Coinductive definitions, such as that of an infinite stream, may often be described by elegant logic programs, but ones for which SLD-refutation is of no value as SLD-derivations fall into infinite loops. Such definitions give rise to…
Two distinct models for self-similar and self-affine river basins are numerically investigated. They yield fractal aggregation patterns following non-trivial power laws in experimentally relevant distributions. Previous numerical estimates…
Observational evidence is presented for periodically variable irradiation of secondary components. This results in strongly modulated mass outflow. Superhumps are then due to enhanced dissipation of the kinetic energy of the stream.…
In this paper we define a flow with limited intersection of its worldlines and we construct and solve functional equations for such flow using a special kind of set embedding. For examples we use particular cases studied in the past by…
We study suspension flows defined over sub-shifts of finite type with continuous roof functions. We prove the existence of suspension flows with uncountably many ergodic measures of maximal entropy. More generally, we prove that any…
We define a partition of a reductive group into finitely many subsets, refining the partition of the group into strata. We state some conjectural properties of these subsets (called substrata) and verify them in some examples.
We present elements of a typing theory for flow networks, where "types", "typings", and "type inference" are formulated in terms of familiar notions from polyhedral analysis and convex optimization. Based on this typing theory, we develop…
Analytical approaches to model the structure of complex networks can be distinguished into two groups according to whether they consider an intensive (e.g., fixed degree sequence and random otherwise) or an extensive (e.g., adjacency…
Every end of an infinite graph $ G $ defines a tangle of infinite order in $ G $. These tangles indicate a highly cohesive substructure in the graph if and only if they are closed in some natural topology. We characterize, for every finite…
The notion of tree entropy was introduced by the author as a normalized limit of the number of spanning trees in finite graphs, but is defined on random infinite rooted graphs. We give some new expressions for tree entropy; one uses…
We observe that some natural mathematical definitions are lifting properties relative to simplest counterexamples, namely the definitions of surjectivity and injectivity of maps, as well as of being connected, separation axioms $T_0$ and…
We define the notion of the partial order of ends of the Cayley graph of a semigroup. We prove that the structure of the ends of a semigroup is invariant under change of finite generating set and at the same time is inherited by…
We present two methods for proving confluence of left-linear term rewrite systems. One is hot-decreasingness, combining the parallel/development closedness theorems with rule labelling based on a terminating subsystem. The other is…
River networks exhibit a complex ramified structure that has inspired decades of studies. Yet, an understanding of the propagation of a single stream remains elusive. Here we invoke a criterion for path selection from fracture mechanics and…
We introduce the definability strength of combinatorial principles. In terms of definability strength, a combinatorial principle is strong if solving a corresponding combinatorial problem could help in simplifying the definition of a…
We consider the problem of classifying the dynamics of complex polynomials $f: \mathbb{C} \to \mathbb{C}$ restricted to their basins of infinity. We synthesize existing combinatorial tools --- tableaux, trees, and laminations --- into a new…
Liquid water, besides being fundamental for life on Earth, has long fascinated scientists due to several anomalies. Different hypotheses have been put forward to explain these peculiarities. The most accredited one foresees the presence in…
River networks serve as a paradigmatic example of all branching networks. Essential to understanding the overall structure of river networks is a knowledge of their detailed architecture. Here we show that sub-branches are distributed…