Related papers: A note on the von Weizs\"{a}cker theorem
We explore the properties of non-piecewise syndetic sets with positive upper density, which we call "discordant", in countably infinite amenable (semi)groups. Sets of this kind are involved in many questions of Ramsey theory and manifest…
In this paper, we introduce a certain random variable closely related to the value-distribution of the Hurwitz zeta-function with algebraic parameter. We prove a version of the limit theorem, where the limit measure is presented by the law…
An equivalent definition of the Fibonacci numbers is that they are the unique sequence such that every integer can be written uniquely as a sum of non-adjacent terms. We can view this as we have bins of length 1, we can take at most one…
The extended de Finetti theorem characterizes exchangeable infinite random sequences as conditionally i.i.d. and shows that the apparently weaker distributional symmetry of spreadability is equivalent to exchangeability. Our main result is…
Considerable thought has been devoted to an adequate definition of the class of infinite, random binary sequences (the sort of sequence that almost certainly arises from flipping a fair coin indefinitely). The first mathematical exploration…
The Hales-Jewett Theorem states that given any finite nonempty set $\A$ and any finite coloring of the free semigroup $S$ over the alphabet $\A$ there is a {\it variable word\/} over $\A$ all of whose instances are the same color. This…
Zeckendorf's theorem states every positive integer has a unique decomposition as a sum of non-adjacent Fibonacci numbers. This result has been generalized to many sequences $\{a_n\}$ arising from an integer positive linear recurrence, each…
The famous \v{S}varc-Milnor Lemma says that a group $G$ acting properly and cocompactly via isometries on a length space $X$ is finitely generated and induces a quasi-isometry equivalence $g\to g\cdot x_0$ for any $x_0\in X$. We redefine…
In the present paper, we are interested in classifying of Collatz sequences on based to the different behavior of these sequences when their lengths tend to infinity. A Collatz infinite sequence can be defined as an infinite ordered set of…
We establish the vector-valued Wiener type theorems for countable projective and inductive limits of quasi-Banach algebras in a weighted setting for both finite and infinite dimensional cases. As an application, we extend the notions of…
A state $\rho=(\rho_n)_{n=1}^{\infty}$ is a sequence such that $\rho_n$ is a density matrix on $n$ qubits. It formalizes the notion of an infinite sequence of qubits. The von Neumann entropy $H(d)$ of a density matrix $d$ is the Shannon…
Our main result is the following: {\it Let $E$ be a Banach space and $D$ be a weakly compact subset of $E$ with $0\notin D$. If $A$ is a bounded subset of $E$ such that every $x^*\in E^*$ with $x^*(D) >0$ attains its supremum on $A$, then…
The theorem of Jentzsch--Szeg\H{o} describes the limit measure of a sequence of discrete measures associated to the zeroes of a sequence of polynomials in one variable. Following the presentation of this result by Andrievskii and Blatt in…
In the given article the notion of infinite norm decomposition of a C$^*$-algebra is investigated. The norm decomposition is some generalization of Peirce decomposition. It is proved that the infinite norm decomposition of any C$^*$-algebra…
In this paper we give an alternative proof of Schreiber's theorem which says that an infinite discrete approximate subgroup in $\mathbb{R}^d$ is relatively dense around a subspace. We also deduce from Schreiber's theorem two new results.…
In \cite{Elek} we proved that the limit of a weakly convergent sequence of finite graphs can be viewed as a graphing or a continuous field of infinite graphs. Thus one can associate a type $II_1$-von Neumann algebra to such graph sequences.…
A finite form of de Finetti's representation theorem is established using elementary information-theoretic tools: The distribution of the first $k$ random variables in an exchangeable binary vector of length $n\geq k$ is close to a mixture…
Andr\'as Bir\'o and Vera S\'os prove that for any subgroup $G$ of $\T$ generated freely by finitely many generators there is a sequence $A\subset \N$ such that for all $\beta \in \T$ we have ($\|.\|$ denotes the distance to the nearest…
In this work we investigate the asymptotic behaviour of weighted partial sums of a particular class of random variables related to Oppenheim series expansions. More precisely, we verify convergence in probability as well as almost sure…
A Riemann-Roch theorem on graph was initiated by M. Baker and S. Norine. In their article [2], a Riemann-Roch theorem on a finite graph with uniform vertex-weight and uniform edge-weight was established and it was suggested a Riemann-Roch…