Related papers: Sweeping by a tame process

We consider dynamical systems arising from substitutions over a finite alphabet. We prove that such a system is linearly repetitive if and only if it is minimal. Based on this characterization we extend various results from primitive…

We consider an exhaustive polling system with three nodes in its transient regime under a switching rule of generalized greedy type. We show that, for the system with Poisson arrivals and service times with finite second moment, the…

We consider a Caratheodory differential equation with a state-dependent convex constraint that changes BV-continuously in time (a perturbed BV-continuous state-dependent sweeping processes). By setting up an appropriate catching-up…

We formulate and study analytically and computationally two families of piecewise linear degree one circle maps. These families offer the rare advantage of being non-trivial but essentially solvable models for the phenomenon of mode-locking…

This note considers fairly general quasi-homogeneous systems of first-order nonlinear ODEs and homogeneous systems of second-order nonlinear ODEs that contain arbitrary functions of several arguments. It presents several exact solutions to…

The set of two-body reduced states of translation invariant, infinite quantum spin chains can be approximated from inside and outside using matrix product states and marginals of finite systems, respectively. These lead to hierarchies of…

In this paper we consider a class of piecewise affine Hamiltonian vector fields whose orbits are piecewise straight lines. We give a first classification result of such systems and show that the orbit-structure of the flow of such a…

Disjunctive finitary programs are a class of logic programs admitting function symbols and hence infinite domains. They have very good computational properties, for example ground queries are decidable while in the general case the stable…

We consider the lattice of all the weak factorization systems on a given finite lattice. We prove that it is semidistributive, trim and congruence uniform. We deduce a graph theoretical approach to the problem of enumerating transfer…

A slalom is a sequence of finite sets of length omega. Slaloms are ordered by coordinatewise inclusion with finitely many exceptions. Improving earlier results of Mildenberger, Shelah and Tsaban, we prove consistency results concerning…

This paper is a sequel to Chaika and Krishnan [arXiv:1612.00434]. We again consider translation invariant measures on families of nearest-neighbor semi-infinite walks on the integer lattice Z^d. We assume that once walks meet, they…

Given an initial family of sets, we may take unions, intersections and complements of the sets contained in this family in order to form a new collection of sets; our construction process is done recursively until we obtain the last family.…

We introduce a system of monadic affine sized types, which substantially generalise usual sized types, and allows this way to capture probabilistic higher-order programs which terminate almost surely. Going beyond plain, strong…

For a class of stationary regularly varying and weakly dependent time series, we prove the so-called complete convergence result for the corresponding space-time point processes. As an application of our main theorem, we give a simple proof…

We study directed sets definable in o-minimal structures, showing that in expansions of ordered fields these admit cofinal definable curves, as well as a suitable analogue in expansions of ordered groups, and furthermore that no analogue…

We develop a theory of k-partitions of the set of infinite words recognizable by classes of finite automata. The theory enables to complete proofs of existing results about topological classifications of the (aperiodic) omega-regular…

In a recent article, we introduced and studied a precise class of dynamical systems called solvable systems. These systems present a dynamic ruled by discontinuous ordinary differential equations with solvable right-hand terms and unique…

The classification of separable operator spaces and systems is commonly believed to be intractable. We analyze this belief from the point of view of Borel complexity theory. On one hand we confirm that the classification problems for…

We study automatic sequences and automatic systems generated by general constant length (nonprimitive) substitutions. While an automatic system is typically uncountable, the set of automatic sequences is countable, implying that most…

Interprocedural analysis by means of partial tabulation of summary functions may not terminate when the same procedure is analyzed for infinitely many abstract calling contexts or when the abstract domain has infinite strictly ascending…