English
Related papers

Related papers: Trivial intersection of $\sigma$-fields and Gibbs …

200 papers

For $n \in \mathbb{N}$ and $\varepsilon > 0$, given a sufficiently long sequence of events in a probability space all of measure at least $\varepsilon$, some $n$ of them will have a common intersection. A more subtle pattern: for any $0 < p…

Combinatorics · Mathematics 2024-06-28 Artem Chernikov , Henry Towsner

We prove that if (X,\mathfrakA,P) is an arbitrary probability space with countably generated \sigma-algebra \mathfrakA, (Y,\mathfrakB,Q) is an arbitrary complete probability space with a lifting \rho and \hat R is a complete probability…

Probability · Mathematics 2007-05-23 W. Strauss , N. D. Macheras , K. Musial

This note identifies compact and {\sigma}-compact subsets of probability measures on a class of metric spaces with respect to the weak convergence topology. Moreover, it is shown by an example, that the space of probability measures on a…

Optimization and Control · Mathematics 2023-07-17 Óscar Vega-Amaya , Fernando Luque-Vásquez

An extension of Marcinkiewicz Interpolation Theorem, allowing intermediate spaces of Orlicz type, is proved. This generalization yields a necessary and sufficient condition so that every quasilinear operator, which maps the set, $S(X,\mu)$,…

Classical Analysis and ODEs · Mathematics 2017-11-28 Ron Kerman , Rama Rawat , Rajesh K. Singh

Let $X$ and $Y$ be real normed spaces and $f \colon X\to Y$ a surjective mapping. Then $f$ satisfies $\{\|f(x)+f(y)\|, \|f(x)-f(y)\|\} = \{\|x+y\|, \|x-y\|\}$, $x,y\in X$, if and only if $f$ is phase equivalent to a surjective linear…

Functional Analysis · Mathematics 2020-11-16 Aleksej Turnsek , Dijana Ilisevic , Matjaz Omladic

A function $f:X\to Y$ between topological spaces is said to be a {\it weakly Gibson function} if $f(\overline{U})\subseteq \overline{f(U)}$ for any open connected set \mbox{$U\subseteq X$}. We prove that if $X$ is a locally connected…

General Topology · Mathematics 2014-07-25 Olena Karlova , Volodymyr Mykhaylyuk

The relational complexity of a subgroup $G$ of $\mathrm{Sym}(\Omega)$ is a measure of the way in which the orbits of $G$ on $\Omega^k$ for various $k$ determine the original action of $G$. Very few precise values of relational complexity…

Group Theory · Mathematics 2024-12-06 Saul D. Freedman , Veronica Kelsey , Colva M. Roney-Dougal

For a Generalized Baumslag-Solitar group $G$ with underling graph a tree, we calculate the intersection $\gamma_{\omega}(G)$ of the lower central series and the intersection $(N_{p})_{\omega}(G)$ of the subgroups of finite index some power…

Group Theory · Mathematics 2025-04-08 V. Metaftsis , D. Tsipa

Motivated by the possibility that physics may be effectively five-dimensional over some range of distance scales, we study the possible gaugings of five-dimensional N=2 supergravity. Using a constructive approach, we derive the conditions…

High Energy Physics - Theory · Physics 2009-11-07 John Ellis , Murat Gunaydin , Marco Zagermann

Let $x_1,...,x_n$ be a list of real numbers, let $s :=\sum_{i=1}^{n}x_i$ and let $h:\mathbb{N} \rightarrow \mathbb{R}$ be a function. We gave a necessary and sufficient condition for $s>h(n)$ (respectively, $s<h(n)$). Let $G=(V,E)$ be a…

Combinatorics · Mathematics 2024-03-05 Xiwu Yang

We prove a general likely intersections theorem, a counterpart to the Zilber-Pink conjectures, under the assumption that the Ax-Schanuel property and some mild additional conditions are known to hold for a given category of complex quotient…

Algebraic Geometry · Mathematics 2026-01-14 Sebastian Eterović , Thomas Scanlon

The Gibbs sampler (GS) is a crucial algorithm for approximating complex calculations, and it is justified by Markov chain theory, the alternating projection theorem, and $I$-projection, separately. We explore the equivalence between these…

Computation · Statistics 2024-10-15 Kun-Lin Kuo , Yuchung J. Wang

Let $A$ and $B$ be sets in a finite vector space. In this paper, we study the magnitude of the set $A\cap f(B)$, where $f$ runs through a set of transformations. More precisely, we will focus on the cases that the set of transformations is…

Combinatorics · Mathematics 2025-11-27 Thang Pham , Semin Yoo

In this note, conditions for the existence and uniqueness of the maximum likelihood estimate for multidimensional predictor, binary response models are introduced from a sensitivity testing point of view. The well known condition of…

Computation · Statistics 2020-11-17 Paul A. Roediger

We use the idea of partial compositeness in a minimal supersymmetric model to relate the fermion and sfermion masses. By assuming that the Higgs and third-generation matter is (mostly) elementary, while the first- and second-generation…

High Energy Physics - Phenomenology · Physics 2019-03-27 Yusuf Buyukdag , Tony Gherghetta , Andrew S. Miller

We consider a model of two (fully) compact polymer chains, coupled through an attractive interaction. These compact chains are represented by Hamiltonian paths (HP), and the coupling favors the existence of common bonds between the chains.…

Statistical Mechanics · Physics 2009-10-31 S. Franz , T. Garel , H. Orland

Let $ G $ be a connected graph. If $\bar{\sigma}(v)$ denotes the arithmetic mean of the distances from $v$ to all other vertices of $G$, then the proximity, $\pi(G)$, of $G$ is defined as the smallest value of $\bar{\sigma}(v)$ over all…

Combinatorics · Mathematics 2022-05-02 Éva Czabarka , Peter Dankelmann , Trevor Olsen , László A. Székely

Necessary and sufficient conditions are given on matrices $A$, $B$ and $S$, having entries in some field $\mathbb F$ and suitable dimensions, such that the linear span of the terms $A^iSB^j$ over $\mathbb F$ is equal to the whole matrix…

Rings and Algebras · Mathematics 2019-02-13 Giacomo Micheli , Joachim Rosenthal , Paolo Vettori

We show strong (and surprisingly simple) lower bounds for weakly learning intersections of halfspaces in the improper setting. Strikingly little is known about this problem. For instance, it is not even known if there is a polynomial-time…

Computational Complexity · Computer Science 2026-05-06 Stefan Tiegel

Let $P$ be a probability on a finite group $G$, ${P^{(n)}}$ $n$-fold convolution of $P$ on $G$. Under mild condition, ${P^{(n)}}$ at $n \to \infty $ converges to the uniform probability on the group $G$. If $A = \left\{ {g \in G,\;P\left( g…

Group Theory · Mathematics 2024-02-05 Oleksandr Vyshnevetskiy