Related papers: Chasing Silver
Localization of supersymmetric $\mathcal{N}=2$ Chern-Simons-Matter theory on a squashed $S^3$ with $SU(2)\times U(1)$ isometry has been studied by different groups of authors. In this paper, we localize the theory on a squashed $S^3$ with…
This paper proves some special cases in which localization of tight closure holds. In particular it studies the condition LC relating to bounding the Loewy lengths of local cohomology of Frobenius iterates of quotient rings.
By using the strong approximation, this paper establishes several limit results on the convergent rate of a infinite series of probabilities on the other law of iterated logarithm.
The local (central) limit theorem precisely describes the behavior of iterated convolution powers of a probability distribution on the $d$-dimensional integer lattice, $\mathbb{Z}^d$. Under certain mild assumptions on the distribution, the…
We study the notion of boundedness in the context of positive existential rules, that is, whether there exists an upper bound to the depth of the chase procedure, that is independent from the initial instance. By focussing our attention on…
``Localization'' has proven to be a valuable tool in the Statistical Learning literature as it allows sharp risk bounds in terms of the problem geometry. Localized bounds seem to be much less exploited in the Stochastic Optimization…
The localization spread gives a criterion to decide between metallic versus insulating behaviour of a material. It is defined as the second moment cumulant of the many-body position operator, divided by the number of electrons. Different…
In this paper, we study locating charging station problem as facility location problem and its variants ($k$-Median, $k$-Facility location and $k$-center). We study the connectivity and the capacity constraints in these problem. Capacity…
The first result in this paper provides a very general $\epsilon$-removal argument for the multilinear restriction estimate. The second result provides a refinement of the multilinear restriction estimate in the case when some terms have…
We review recent progress in the study of transport properties of interacting electrons subject to a disordered potential which is strong enough to localize all single-particle states. This review may also serve as a guide to the recent…
We obtain a relatively simple criterion for when a forcing has the ${<}\,\delta$-approximation property, generalizing a result of Unger. Afterwards we apply this criterion to construct variants of Mitchell Forcing in order to answer…
Our main motivation for the work presented in this paper is to construct a localization functor, in a certain sense dual to the f-localization of Bousfield and Farjoun, and to study some of its properties. We succeed in a case which is…
We consider Sinai's random walk in random environment $(S_n)_{n\in\mathbb{N}}$. We prove a local limit theorem for $(S_n)_{n\in\mathbb{N}}$ under the annealed law $\mathbb{P}$. As a consequence, we get an equivalent for the annealed…
A tiling is said to have infinite local complexity (ILC) if it contains infinitely many two-tile patches up to rigid motions. In this work, we provide examples of substitution rules that generate tilings with ILC. The proof relies on…
We establish the local-to-global property of the synthetic curvature-dimension condition for essentially non-branching locally finite metric-measure spaces, extending the work [F. Cavalletti, E. Milman \textit{Invent. Math.} 226 (2021), no.…
Imagine a world in which there exist physical resources for non-local correlations whose CHSH value lies between 2 and $X\leq 4$. Assume that such resources can be mixed in some sense. Using Connes's result on the extension of…
The hypothesis of locality, its origin and consequences are discussed. This supposition is necessary for establishing the local spacetime frame of accelerated observers; in this connection, the measurement of length in a rotating system is…
We study the termination problem of the chase algorithm, a central tool in various database problems such as the constraint implication problem, Conjunctive Query optimization, rewriting queries using views, data exchange, and data…
Based on works of Saharon Shelah, Jakob Kellner, and Anda T\u{a}nasie for controlling the cardinal characteristics of the continuum in ccc forcing extensions, in the author's master's thesis was introduced a new combinatorial notion: the…
The Boolean satisfiability problem (SAT) is a famous NP-complete problem in computer science. An effective way for solving a satisfiable SAT problem is the stochastic local search (SLS). However, in this method, the initialization is…