相关论文: Minimal elements of stopping time $\sigma$-algebra…

Does there exist for any $\sigma$-algebra a minimal (with respect to inclusion) generating set? We formulate this problem and answer it in the very special instance of partition generated and standard measurable spaces, the general case…

To constitute atoms of a $\sigma$ algebra is not a easy task due to the large number of its elements. However, determining them via generators seems a feasible and simple way since most $\sigma$ algebras are generated by their smaller…

We give an explicit formula for the time projection in an arbitrary von Neumann algebra from which all its basic properties can be easily derived. The analysis of the situation when this time projection is a conditional expectation is also…

We give a short and elementary proof that the first hitting time of a $F_\sigma$ set by the jump process of a c\`{a}dl\`{a}g adapted process is a stopping time.

In this paper we analyze the notion of "stopping time complexity", informally defined as the amount of information needed to specify when to stop while reading an infinite sequence. This notion was introduced by Vovk and Pavlovic (2016). It…

We show that an algebra over a cyclic operad supplied with an additional linear algebra datum called Hodge decomposition admits a minimal model whose structure maps are given in terms of summation over trees. This minimal model is unique up…

In this note, we give an algorithm that starting with a Sullivan algebra gives us its minimal model. This algorithm is a kind of modified AT-model algorithm used to compute in the past other kinds of topology information such as…

We propose a sequential topology on the space of sub-$\sigma$-algebras of a separable probability space $(\Omega,\mathcal{F},\mathbb{P})$ by linking conditional expectations on $L^{2}$ along sequences of sub-$\sigma$-algebras. The varying…

We show that every $\alpha$-approximate minimum cut in a connected graph is the unique minimum $(S,T)$-terminal cut for some subsets $S$ and $T$ of vertices each of size at most $\lfloor2\alpha\rfloor+1$. This leads to an alternative proof…

Motivated by a problem in graph theory, this article introduces an algebra called the balanced algebra. This algebra is defined by generators and relations, and the main goal is to find a minimal set of relations for it.

We give a characterisation of representation-finite symmetric algebras of period four, and describe their basic algebras. In particular, if such an algebra is indecomposable, it has at most two simple modules.

In all but special circumstances, measurements of time-dependent processes reflect internal structures and correlations only indirectly. Building predictive models of such hidden information sources requires discovering, in some way, the…

A general simplicity problem in category theory is proposed. A particular example, the simplest choice of generators of an algebra is specified and illustrated by an example.

The paper studies thin times which are random times whose graph is contained in a countable union of the graphs of stopping times with respect to a reference filtration $\mathbb F$. We show that a generic random time can be decomposed into…

Denote the alternating and symmetric groups of degree $n$ by $A_n$ and $S_n$ respectively. Consider a permutation $\sigma\in S_n$ all of whose nontrivial cycles are of the same length. We find the minimal polynomials of $\sigma$ in the…

We study the minimal gap statistic for fractional parts of sequences of the form $\mathcal A^\alpha = \{\alpha a(n)\}$ where $\mathcal A = \{a(n)\}$ is a sequence of distinct of integers. Assuming that the additive energy of the sequence is…

Let $(A,\sigma)$ be a central simple algebra with an orthogonal involution. It is well-known that $O(A,\sigma)$ contains elements of reduced norm $-1$ if and only if the Brauer class of $A$ is trivial. We generalize this statement to…

We continue our study of topological partial *algebras, focusing our attention to the interplay between the various partial multiplications. The special case of partial *-algebras of operators is examined first, in particular the link…

We give two equivalent definitions of sigma algebras that are atomless conditionally to a smaller sigma algebra.

There exists a simple, didactically useful one-to-one relationship between stopping times and adapted c\`agl\`ad (LCRL) processes that are non-increasing and take the values 0 and 1 only. As a consequence, stopping times are always hitting…