Related papers: Decomposability of multiparameter CAR flows
We call a (simple) graph G codismantlable if either it has no edges or else it has a codominated vertex x, meaning that the closed neighborhood of x contains that of one of its neighbor, such that G-x codismantlable. We prove that if G is…
It is proved that the existence of a countable extremally disconnected Boolean topological group containing a family of open subgroups whose intersection has empty interior implies the existence of a rapid ultrafilter.
We provide examples of groups which are indecomposable by direct product, and more generally which are uniquely decomposable in direct products of indecomposable groups. Examples include Coxeter groups, for which we give an alternative…
In this paper we study flows $\varphi:M\times\mathbb{R}\longrightarrow M$ having an isolated non-saddle set. We see that the complexity of the region of influence of an isolated non-saddle set $K$ depends on the way in which $K$ sits on the…
In this paper, we consider the flow of an incompressible fluid in a deformable porous solid. We present a mathematical model using the framework offered by the theory of interacting continua. In its most general form, this framework…
There are presented sufficient conditions for existence of an infinite family of trajectories of an analytic gradient flow which converge to a critical point.
We construct higher Chow cycles of type (2,1) on some families of K3 surfaces with non-symplectic automorphisms of order 3 and prove that our cycles are indecomposable for very general members. The proof is a combination of some…
We give different proofs and prove new results on the non complete solvability of some systems of complex first order p.d.e.'s, especially related to the analysis on CR manifolds.
Reid asked whether all convex-cocompact subgroups of mapping class groups are separable. Using a construction of Manning-Mj-Sageev, we give examples of separable convex-cocompact subgroups that are free of arbitrary finite rank, while prior…
We consider the problem of multicommodity flows in planar graphs. Seymour showed that if the union of supply and demand graphs is planar, then the cut condition is sufficient for routing demands. Okamura-Seymour showed that if all demands…
The conditions of multi-phase equilibrium are solved for generic polydisperse systems. The case of multiple polydispersity is treated, where several properties (e.g. size, charge, shape) simultaneously vary from one particle to another. By…
The concept of process is ubiquitous in science, engineering and everyday life. Category theory, and monoidal categories in particular, provide an abstract framework for modelling processes of many kinds. In this paper, we concentrate on…
We recall several known results about minimally 2-connected graphs, and show that they all follow from a decomposition theorem. Starting from an analogy with critically 2-connected graphs, we give structural characterizations of the classes…
Groups with a non-cyclic Sylow $p$-subgroup have too many representations over a field of characteristic~$p$ to describe them fully. A~natural question arises, whether the world of representations coming from algebraic varieties with a…
A {\em $(d,h)$-decomposition} of a graph $G$ is an order pair $(D,H)$ such that $H$ is a subgraph of $G$ where $H$ has the maximum degree at most $h$ and $D$ is an acyclic orientation of $G-E(H)$ of maximum out-degree at most $d$. A graph…
A one-parameter family of coupled flows depending on a parameter $\kappa>0$ is introduced which reduces when $\kappa=1$ to the coupled flow of a metric $\omega$ with a $(1,1)$-form $\alpha$ due recently to Y. Li, Y. Yuan, and Y. Zhang. It…
We show that planar embeddable 3-connected CAD graphs are generically non-soluble. A CAD graph represents a configuration of points on the Euclidean plane with just enough distance dimensions between them to ensure rigidity. Formally, a CAD…
In this article some noncommutative topological objects such as NC mapping cone and NC mapping cylinder are introduced. We will see that these objects are equipped with the NCCW complex structure of [PEDERSEN]. As a generalization we…
Let $X$ be a set, $\ka$ be a cardinal number and let $\iH$ be a family of subsets of $X$ which covers each $x\in X$ at least $\ka$ times. What assumptions can ensure that $\iH$ can be decomposed into $\kappa$ many disjoint subcovers? We…
In this paper, we present the derivation of a multicontinuum model for the coupled flow and transport equations by applying multicontinuum homogenization. We perform the multicontinuum expansion for both flow and transport solutions and…