Related papers: Decomposability of multiparameter CAR flows

A decomposition of a chemical reaction network (CRN) is produced by partitioning its set of reactions. The partition induces networks, called subnetworks, that are "smaller" than the given CRN which, at this point, can be called parent…

The proper scale decomposition in flows with significant density variations is not as straightforward as in incompressible flows, with many possible ways to define a `length-scale.' A choice can be made according to the so-called…

A multigraph G is triangle decomposable if its edge set can be partitioned into subsets, each of which induces a triangle of G, and rationally triangle decomposable if its triangles can be assigned rational weights such that for each edge e…

The global existence of solutions to incompressible viscoelastic flows has been a longstanding open problem, even for the global weak solution. Under some special structure ("div-curl" condition) the global small smooth solution was…

A polycrystalline solid is modelled as an ensemble of random irregular polyhedra filling the entire space occupied by the solid body, leaving no voids or flaws between them. Adjacent grains can slide with a relative velocity proportional to…

Interpreting RG flows as dynamical systems in the space of couplings we produce a variety of constraints, global (topological) as well as local. These constraints, in turn, rule out some of the proposed RG flows and also predict new phases…

Simple cycles on a digraph form a trace monoid under the rule that two such cycles commute if and only if they are vertex disjoint. This rule describes the spatial configuration of simple cycles on the digraph. Cartier and Foata have showed…

We construct, for each 2<r<18, an explicit family of higher Chow cycles of type (2,1) on a family of lattice-polarized K3 surfaces of generic Picard rank r, and prove that the indecomposable part of this cycle is non-torsion for very…

A graph is strongly even-cycle decomposable if the edge set of every subdivision with an even number of edges can be partitioned into cycles of even length. We prove that several fundamental composition operations that preserve the property…

Let $C_{k}$ (resp. $P_{k}$) denote the cycle (resp. path) of length $k$. In this paper, we examine the necessary and sufficient conditions for the existence of a $(8; p, q)$-decomposition of tensor product and wreath product of complete…

Considering systems of separations in a graph that separate every pair of a given set of vertex sets that are themselves not separated by these separations, we determine conditions under which such a separation system contains a nested…

We completely classify the orientable infinite-type surfaces $S$ such that $\operatorname{PMap}(S)$, the pure mapping class group, has automatic continuity. This classification includes surfaces with noncompact boundary. In the case of…

A Cylindrical Algebraic Decomposition (CAD) is a decomposition of R^n into a finite collection of semialgebraic cells. A CAD satisfies the "frontier condition" if, for every cell C, there is a collection of cells of the decomposition whose…

Quotients $Y=X/conj$ by the complex conjugation $conj\: X\to X$ for complex surfaces $X$ defined over $\R$ tend to be completely decomposable when they are simply connected, i.e., split into connected sums $\#_n CP^2\#_m\barCP^2$ if…

Many questions at the core of graph theory can be formulated as questions about certain group-valued flows: examples are the cycle double cover conjecture, Berge-Fulkerson conjecture, and Tutte's 3-flow, 4-flow, and 5-flow conjectures. As…

This paper shows that---under suitable conditions on a cone $C$---any element in the convex hull of a decomposably $C$-antichain-convex set $Y$ is $C$-Pareto dominated by some element of $Y$. Building on this, the paper proves the…

We study the flow of an electrically charged fluid through an elastic and porous medium. A three continuum model consisting of an elastic solid, a viscous fluid, and a mobile charge continuum is used. The relevant laws of physics are…

We prove that for any convex polygon $S$ with at least four sides, or a concave one with no parallel sides, and any $m>0$, there is an $m$-fold covering of the plane with homothetic copies of $S$ that cannot be decomposed into two…

Let $G$ be a graph of order $n$. The path decomposition of $G$ is a set of disjoint paths, say $\mathcal{P}$, which cover all vertices of $G$. If all paths are induced paths in $G$, then we say $\mathcal{P}$ is an induced path decomposition…

In this article we present a unified way to smooth certain multiple structures called ropes on smooth varieties. We prove that most ropes of arbitrary multiplicity, supported on smooth curves can be smoothed. By a rope being smoothable we…