Related papers: Projective Stationary Sets and Strong Reflection P…
In this article, for generalized projective spaces with any weights, we prove four main theorems in three different contexts where the Unital Set Condition USC (Definition $2.8$) on ideals is further examined. In the first context we prove,…
We study embeddings of continuous dynamical systems in larger dimensions via projector operators. We call this technique PEDS, projective embedding of dynamical systems, as the stable fixed point of the dynamics are recovered via projection…
Neural networks are widely used as a model for classification in a large variety of tasks. Typically, a learnable transformation (i.e. the classifier) is placed at the end of such models returning a value for each class used for…
We consider the reflection of light, from a stationary source, off of a uniformly moving flat mirror, and derive the relativistic reflection law using well-known properties of conic sections. The effective surface of reflection (ESR) is…
We study reflection principles of Peano Arithmetic PA which are based on both proof and provability. Any such reflection principle in PA is equivalent to either $\Box P\!\rightarrow\! P$ ($\Box P$ stands for `$P$ is provable') or $\Box^k…
The diffraction of various random subsets of the integer lattice $\mathbb{Z}^{d}$, such as the coin tossing and related systems, are well understood. Here, we go one important step beyond and consider random point sets in $\mathbb{R}^{d}$.…
We provide a framework for empirical process theory of locally stationary processes using the functional dependence measure. Our results extend known results for stationary Markov chains and mixing sequences by another common possibility to…
In this paper it is proved that, when $Q$ is a quiver that admits some closure, for any algebraically closed field $K$ and any finite dimensional $K$-linear representation $\mathcal{X}$ of $Q$, if ${\rm Ext}^1_{KQ}(\mathcal{X},KQ)=0$ then…
An important result in real algebraic geometry is the projection theorem: every projection of a semialgebraic set is again semialgebraic. This theorem and some of its conclusions lie at the basis of many other results, for example the…
This paper is concerned with devising the nonlinear optimal guidance for intercepting a stationary target with a fixed impact time. According to Pontryagin's Maximum Principle (PMP), some optimality conditions for the solutions of the…
A projective rectangle is like a projective plane that has different lengths in two directions. We develop the basic theory of projective rectangles including incidence properties, projective subplanes, configuration counts, a partial…
We develop a behavioural theory of reflective sequential algorithms (RSAs), i.e. sequential algorithms that can modify their own behaviour. The theory comprises a set of language-independent postulates defining the class of RSAs, an…
A pointwise definable model is one in which every object is definable without parameters. In a model of set theory, this property strengthens V=HOD, but is not first-order expressible. Nevertheless, if ZFC is consistent, then there are…
Stationary points or derivative zero crossings of a regression function correspond to points where a trend reverses, making their estimation scientifically important. Existing approaches to uncertainty quantification for stationary points…
Motivated by Arveson's conjecture, we introduce a notion of hyperrigidity for a partial order on the state space of a $C^*$-algebra $B$. We show how this property is equivalent to the existence of a boundary: a subset of the pure states…
It was recently proven that the correlation function of the stationary version of a reflected L\'evy process is nonnegative, nonincreasing and convex. In another branch of the literature it was established that the mean value of the…
Neural networks are widely used as a model for classification in a large variety of tasks. Typically, a learnable transformation (i.e. the classifier) is placed at the end of such models returning a value for each class used for…
We use algorithmic methods from online learning to explore some important objects at the intersection of model theory and combinatorics, and find natural ways that algorithmic methods can detect and explain (and improve our understanding…
We prove a number of results on the determinacy of $\sigma$-projective sets of reals, i.e., those belonging to the smallest pointclass containing the open sets and closed under complements, countable unions, and projections. We first prove…
Mass-stationarity means that the origin is at a typical location in the mass of a random measure. It is an intrinsic characterisation of Palm versions with respect to stationary random measures. Stationarity is the special case when the…