Related papers: When the Weak Separation Condition implies the Gen…

Can the joint measures of quenched disordered lattice spin models (with finite range) on the product of spin-space and disorder-space be represented as (suitably generalized) Gibbs measures of an ``annealed system''? - We prove that there…

We review and clarify the sufficient conditions for uniquely defining the generalized weak value as the weak limit of a conditioned average using the contextual values formalism introduced in Dressel J, Agarwal S and Jordan A N 2010 Phys.…

Submodular functions are known to satisfy various forms of fractional subadditivity. This work investigates the conditions for equality to hold exactly or approximately in the fractional subadditivity of submodular functions. We establish…

Some type-based approaches to termination use sized types: an ordinal bound for the size of a data structure is stored in its type. A recursive function over a sized type is accepted if it is visible in the type system that recursive calls…

Verifying lower-semicontinuity of integral functionals in the weak topology of Sobolev spaces is a central theme in the calculus of variations. For integral functionals with $p$-growth, quasiconvexity is a necessary condition for weak…

In this paper we consider the shadowing property for iterated function systems,(IFS). Some important result about shadowing property are extended to iterated function systems. For example, we define topological conjugacy for IFS and prove…

We completely describe the equilibrium states of a class of potentials over the full shift which includes Falconer's singular value function for affine iterated function systems with invertible affinities. We show that the number of…

A finitely presented group is weakly geometrically simply connected (wgsc) if it is the fundamental group of some compact polyhedron whose universal covering is wgsc i.e. it has an exhaustion by compact connected and simply connected…

We show that topological mixing, weak mixing and total transitivity are equivalent for coded systems. We provide an example of a mixing coded system which cannot be approximated by any increasing sequence of mixing shifts of finite type,…

We study the problem of empirical coordination subject to a fidelity criterion for a general set-up. We prove a result which indicates a strong connection between our framework and the framework of empirical coordination developed in [1].…

We consider the problem of birationally modifying a morphism of complete varieties to make it a morphism from a nonsingular variety to a normal variety. Our main result is to give a counterexample to this problem. This example also is a…

We introduce a notion of weak convergence in arbitrary metric spaces. Metric functionals are key in our analysis: weak convergence of sequences in a given metric space is tested against all the metric functionals defined on said space. When…

In the literature, necessary and sufficient conditions in terms of variational inequalities are introduced to characterize minimizers of convex set valued functions with values in a conlinear space. Similar results are proved for a weaker…

We study existence of random elements with partially specified distributions. The technique relies on the existence of a positive extension for linear functionals accompanied by additional conditions that ensure the regularity of the…

We prove that certain families of homogenous affine iterated function systems in $\mathbb{R}^d$ have the property that the open set condition and the existence of exact overlaps both occur densely in the space of translation parameters.…

We generalize Jacod's condition and introduce a new type sufficient condition for the uniform integrability of the general stochastic exponential.

A new condition called ${\cal T}$ condition is introduced for the first time and used to study a pair of isotopic loops. Under this condition, a loop in the pair is a WIPL if and only if the other loop is a WIPL. Furthermore, such WIPLs are…

Looped-functionals have been shown to be relevant for the analysis of a wide variety of systems. However, the conditions obtained in previous works on the analysis of sampled-data, impulsive and switched systems have only been shown to be…

A long-standing shortcoming of statically typed functional languages is that type checking does not rule out pattern-matching failures (run-time match exceptions). Refinement types distinguish different values of datatypes; if a program…

In this work, we propose and study a framework of generalized proximal point algorithms associated with a maximally monotone operator. We indicate sufficient conditions on the regularization and relaxation parameters of generalized proximal…