Related papers: A separation property for iterated function system…
We introduce a generalization of stationary set reflection which we call "filter reflection", and show it is compatible with the axiom of constructibility as well as with strong forcing axioms. We prove the independence of filter reflection…
Convenient mixed functions with strongly non-degenerate Newton boundaries have Milnor fibrations, as the isolatedness of the singularity follows from the convenience. In this paper, we consider the Milnor fibration for non-convenient mixed…
Let X be a countably infinite set of real numbers and let Y_x, x \in X, be an independent family of stationary random subsets of the real numbers, e.g. homogeneous Poisson point processes. We give criteria for the a.s. existence of various…
We consider a linear implicit-explicit (IMEX) time discretization of the Cahn-Hilliard equation with a source term, endowed with Dirichlet boundary conditions. For every time step small enough, we build an exponential attractor of the…
To remove the linear infrared divergences in quenched approximation we include the massive fermion loop to the photon spectral function.Spectral function of fermion has no one particle singularity if we fix the anomalous dimension to be…
There are theorems in the literature which are referred as Maschke type theorems, because of the attempt to generalize Maschke's classical theorem. Our remark is that all these theorems are in fact providing sufficient conditions for the…
We study random independent and identically distributed iterations of functions from an iterated function system of homeomorphisms on the circle which is minimal. We show how such systems can be analyzed in terms of iterated function…
In this article, we deal with the uniform effective disjunction property and the uniform effective interpolation property, which are weaker versions of the classical effective disjunction property and the effective interpolation property.\\…
We prove a structure theorem for multiplicative functions which states that an arbitrary bounded multiplicative function can be decomposed into two terms, one that is approximately periodic and another that has small Gowers uniformity norm…
Under the assumption of (positive) homogeneity (PH in the sequel) of the corresponding utility functions, we construct polynomial time algorithms for the weak separability, the collective consumption behavior and some related problems.…
We establish new recurrence and multiple recurrence results for a rather large family $\mathcal{F}$ of non-polynomial functions which includes tempered functions defined in [11], as well as functions from a Hardy field with the property…
We establish several results concerning the expected general phenomenon that, given a multiplicative function $f:\mathbb{N}\to\mathbb{C}$, the values of $f(n)$ and $f(n+a)$ are "generally" independent unless $f$ is of a "special" form.…
In this paper we develop a new approach for studying overlapping iterated function systems. This approach is inspired by a famous result due to Khintchine from Diophantine approximation. This result shows that for a family of limsup sets,…
It is shown that separation conditions (separation curves) are fundamental objects of separability theory. They are used for the classification of certain clases of separable systems, for the proof of bi-Hamiltonian property and finally…
Partial differential equations with discrete (concentrated) state-dependent delays in the space of continuous functions are investigated. In general, the corresponding initial value problem is not well posed, so we find an additional…
We make use of a finite support product of the Jensen minimal forcing to define a model of set theory in which the separation theorem fails for projective classes $\mathbf\Sigma^1_n$ and $\mathbf\Pi^1_n$, for a given $n\ge3$.
We investigate certain spectral properties of the Bernoulli convolution measures on attractor sets arising from iterated function systems on the real line. In particular, we examine collections of orthogonal exponential functions in the…
For a complexity class $C$ and language $L$, a constructive separation of $L \notin C$ gives an efficient algorithm (also called a refuter) to find counterexamples (bad inputs) for every $C$-algorithm attempting to decide $L$. We study the…
We prove that a Gibbs point process interacting via a finite-range, repulsive potential $\phi$ exhibits a strong spatial mixing property for activities $\lambda < e/\Delta_{\phi}$, where $\Delta_{\phi}$ is the potential-weighted connective…
New results on the behaviour of the fast motion in slow-fast systems of ODEs with dependence on the fast time are given in terms of tracking of nonautonomous attractors. Under quite general assumptions, including the uniform ultimate…