Related papers: Partially Dominated Splittings
Inspired by the work of Pujals and Sambarino on dominated splitting, we present billiards with a modified reflection law which constitute simple examples of dynamical systems with limit sets with dominated splitting and where the dynamics…
A new method is presented for the simplification of loop integrals in one particle irreducible diagrams with large numbers of external lines, based on the partial fractioning of products of propagators. Whenever a loop diagram in $d$…
The aim of this note is to show that Poincar\'e inequalities imply corresponding weighted versions in a quite general setting. Fractional Poincar\'e inequalities are considered, too. The proof is short and does not involve covering…
The study of power domination in graphs arises from the problem of placing a minimum number of measurement devices in an electrical network while monitoring the entire network. A power dominating set of a graph is a set of vertices from…
We examine the effects of a periodically varying flow velocity on the standing and travelling wave patterns formed by the flow-distributed oscillation (FDO) mechanism. In the kinematic (or diffusionless) limit, the phase fronts undergo a…
We consider the class of partially hyperbolic diffeomorphisms $f:M\to M$ obtained as the discretization of topological Anosov flows. We show uniqueness of minimal unstable lamination for these systems provided that the underlying Anosov…
Bivariate partial-sums discrete probability distributions are defined. The question of the existence of a limit distribution for iterated partial summations is solved for finite-support bivariate distributions which satisfy conditions under…
Quasiparticles in semiconductors -- such as microcavity polaritons -- can form condensates in which the steady-state density profile is set by the balance of pumping and decay. By taking account of the polarization degree of freedom for a…
Poincar\'e recurrence theorem implies the density of recurrent points for volume-preserving dynamical systems on compact domains. The density of closed orbits in the non-wandering set is one of the essential properties of Axiom A and chaos.…
This article is concerned with finite rank stability theory, and more precisely two classical ways to decompose a type using minimal types. The first is its domination equivalence to a Morley power of minimal types, and the second its…
This paper reviews a class of univariate piecewise polynomial functions known as discrete splines, which share properties analogous to the better-known class of spline functions, but where continuity in derivatives is replaced by (a…
Power domination is a graph theoretic model which captures how phasor measurement units (PMUs) can be used to monitor a power grid. Fragile power domination takes into account the fact that PMUs may break or otherwise fail. In this model,…
In this work, our primary goal is to study the Poincare map and the existence of limit cycles for Welander's model that describes ocean convection. Welander developed two versions of his model, one with a smooth transition between…
This article introduces the splitting method to systems responding to rough paths as external stimuli. The focus is on nonlinear partial differential equations with rough noise but we also cover rough differential equations. Applications to…
We propose a new network reliability measure for some particular kind of service networks, which we refer to as domination reliability. We relate this new reliability measure to the domination polynomial of a graph and the coverage…
A set of vertices $S$ in a simple isolate-free graph $G$ is a semi-total dominating set of $G$ if it is a dominating set of $G$ and every vertex of $S$ is within distance 2 or less with another vertex of $S$. The semi-total domination…
For differentiable dynamical systems with dominated splittings, we give upper estimates on the measure-theoretic tail entropy in terms of Lyapunov exponents. As our primary application, we verify the upper semi-continuity of metric entropy…
A dominating set of a graph is a set of vertices such that every vertex not in the set has at least one neighbor in the set. The problem of counting dominating sets is #P-complete for chordal graphs but solvable in polynomial time for its…
In this paper we study relations between connected and weakly convex domination numbers. We show that in general the difference between these numbers can be arbitrarily large and we focus on the graphs for which a weakly convex domination…
We discuss control of low-dimensional systems which, when uncontrolled, are integrable in the Hamiltonian sense. The controller targets an exact solution of the system in a region where the uncontrolled dynamics has invariant tori. Both…