Related papers: Decomposability of multiparameter CAR flows
Let $P$ be a set of $n$ points in general position on the plane. A set of closed convex polygons with vertices in $P$, and with pairwise disjoint interiors is called a convex decomposition of $P$ if their union is the convex hull of $P$,…
A family of multi-value cellular automaton (CA) associated with traffic flow is presented in this paper. The family is obtained by extending the rule-184 CA, which is an ultradiscrete analogue to the Burgers equation. CA models in the…
The category of flows is not cartesian closed. We construct a closed symmetric monoidal structure which has moreover a satisfactory behavior from the computer scientific viewpoint.
We show that every sum system is divisible. Combined with B. V. R. Bhat and R. Srinivasan's result, this shows that every product system arising from a sum system (and every generalized CCR flow) is either of type I or type III. A…
We say a graph $H$ decomposes a graph $G$ if there exists a partition of the edges of $G$ into subgraphs isomorphic to $H$. We seek to characterize necessary and sufficient conditions for a cycle of length $k$, denoted $C_k$, to decompose…
We study pivotal decomposition schemes and investigate classes of pivotally decomposable operations. We provide sufficient conditions on pivotal operations that guarantee that the corresponding classes of pivotally decomposable operations…
We describe a family $\textrm{Cyc}_p(\mathcal{F})$ of marked cycle curves that parameterize the cycles of period $p$ of a given family $\mathcal{F}$ of dynamical systems. We produce algorithms to compute a canonical cell decomposition for…
An indecomposable flow $f$ on a signed graph $\Sigma$ is a nontrivial integral flow that cannot be decomposed into $f=f_1+f_2$, where $f_1,f_2$ are nontrivial integral flows having the same sign (both $\geq 0$ or both $\leq 0$) at each edge…
The combination of this paper and its companion complete the classification of monodromy groups of indecomposable coverings of complex curves $f:X\rightarrow \mathbb P^1$ of sufficiently large degree in comparison to the genus of $X$. In…
A path system $\mathcal{P}$ in a graph $G=(V,E)$ is said to be irreducible if there does not exist a partition $V= A\sqcup B$ such that $\mathcal{P}$ restricts to a path system on both $G[A]$ and $G[B]$. In this paper, we construct an…
Under suitable conditions a flow on a torus $C^{(p)}$--close, with $p$ large enough, to a quasi periodic diophantine rotation is shown to be conjugated to the quasi periodic rotation by a map that is analytic in the perturbation size. This…
Two fluid configurations along a flow are conjugate if there is a one parameter family of geodesics (fluid flows) joining them to infinitesimal order. Geometrically, they can be seen as a consequence of the (infinite dimensional) group of…
This paper concerns a question that frequently occurs in various applications: Is any diffusive coupling of stable linear systems, also stable? Although it has been known for a long time that this is not the case, we shall identify a…
Given a closed, convex and pointed cone K in R^n, we present a result which infers K-irreducibility of sets of K-quasipositive matrices from strong connectedness of certain bipartite digraphs. The matrix-sets are defined via products, and…
We study two decomposition problems in combinatorial geometry. The first part deals with the decomposition of multiple coverings of the plane. We say that a planar set is cover-decomposable if there is a constant m such that any m-fold…
We give a decomposition of the suspension of a polyhedral join in terms of the polyhedral smash product of the suspension of the family of pairs, and study some cases in which the formula can be desuspended, particularly for polyhedral…
In this paper, we give necessary conditions for stability of coupled autonomous vehicles in R. We focus on linear arrays with decentralized vehicles, where each vehicle interacts with only a few of its neighbors. We obtain explicit…
In the present work, we propose a consistent and conservative model for multiphase and multicomponent incompressible flows, where there can be arbitrary numbers of phases and components. Each phase has a background fluid called the pure…
Let $G$ be a graph of order $n$. A path decomposition $\mathcal{P}$ of $G$ is a collection of edge-disjoint paths that covers all the edges of $G$. Let $p(G)$ denote the minimum number of paths needed in a path decomposition of $G$. Gallai…
A mathematical notion of interaction is introduced for noncommutative dynamical systems, i.e., for one parameter groups of *-automorphisms of $\Cal B(H)$ endowed with a certain causal structure. With any interaction there is a well-defined…