We introduce a new condition which extends the definition of sticky particle dynamics to the case of discontinuous initial velocities $u_0$ with negative jumps. We show the existence of a stochastic process and a forward flow $\phi$ satisfying $X_{s+t}=\phi (X_s,t,P_s,u_s)$ and $\mathrm{d}{X}_t=\mathrm{E}[u_0\left(X_0\right)/X_t]\mathrm{d}t$, where $P_s=P{X}_s^{-1}$ is the law of $X_s$ and $u_s\left(x\right)=\mathrm{E}[u_0\left(X_0\right)/X_s=x]$ is the velocity of particle $x$ at time $s\ge 0$. Results on the flow characterization and Lipschitz continuity are also given.Moreover, the map $(x,t)\mapsto M(x,t):=P(X_t\le x)$ is the entropy solution of a scalar conservation law ${\partial }_{t}M+{\partial }_x\left(A\left(M\right)\right)=0$ where the flux $A$ represents the particles...

In [1] Burger and Mynhardt introduced the idea of universal fixers. Let G = (V, E) be a graph with n vertices and G’ a copy of G. For a bijective function π: V(G) → V(G’), define the prism πG of G as follows: V(πG) = V(G) ∪ V(G’) and $E\left(\pi G\right)=E\left(G\right)\cup E\left(G^{\text{'}}\right)\cup M_{\pi }$, where $M_{\pi }=u\pi \left(u\right)\left|u\in V\right(G)$. Let γ(G) be the domination number of G. If γ(πG) = γ(G) for any bijective function π, then G is called a universal fixer. In [9] it is conjectured that the only universal fixers are the edgeless graphs K̅ₙ. In this work we generalize the concept of universal...

Every bounded convex open set Ω of Rm is endowed with its Hilbert metric dΩ. We give a necessary and sufficient condition, called quasisymmetric convexity, for this metric space to be hyperbolic. As a corollary, when the boundary is real analytic, Ω is always hyperbolic. In dimension 2, this condition is: in affine coordinates, the boundary ∂Ω is locally the graph of a C1 strictly convex function whose derivative is quasisymmetric.

The notion of convex set for subsets of lattices in one particular case was introduced in [1], where it was used to study Paretto's principle in the theory of group choice. This notion is based on a betweenness relation due to Glivenko [2]. Betweenness is used very widely in lattice theory as basis for lattice geometry (see [3], and, especially [4 part 1]).In the present paper the relative notions of convexity are considered for subsets of an arbitrary lattice.In section 1 certain relative notions...

A subset of a vector space is called countably convex if it is a countable union of convex sets. Classification of countably convex subsets of topological vector spaces is addressed in this paper. An ordinal-valued rank function ϱ is introduced to measure the complexity of local nonconvexity points in subsets of topological vector spaces. Then ϱ is used to give a necessary and sufficient condition for countable convexity of closed sets. Theorem. Suppose that S is a closed subset of a Polish linear...