Related papers: Uniformity seminorms on $\ell^\infty$ and applicat…
Relying on the notions of submodular function and partial metric, we introduce normed inverse semigroups as a generalization of normed groups and sup-semilattices equipped with an upper valuation. We define the property of skew-convexity…
We study poset limits given by sequences of finite interval orders or, as a special case, finite semiorders. In the interval order case, we show that every such limit can be represented by a probability measure on the space of closed…
We introduce an ergodic approach to the study of {\em joint normality} of representations of numbers. For example, we show that for any integer $b \geq 2$ almost every number $x \in [0,1)$ is jointly normal with respect to the $b$-expansion…
Let X be a linear space over K, K=R or K=C and let for n>1 \rho_i be s-convex semimodular defined on X for any i\in{1,...,n-1}. Put \rho=\max_{1\leq i \leq n-1}\{\rho_i\} and X_{\rho}= { x \in X: \rho(dx) < \infty for some d > 0 }. In this…
We obtain a complete characterization of the norm attainment set of a bounded linear functional on a normed space, in terms of a semi-inner-product defined on the space. Motivated by this result, we further apply the concept of…
We study mean ergodicity in amenable operator semigroups and establish the connection to the convergence of strong and weak ergodic nets. We then use these results in order to show the convergence of uniform families of ergodic nets that…
Ramsey theory is the study of conditions under which mathematical objects show order when partitioned. Ramsey theory on the integers concerns itself with partitions of $[1,n]$ into $r$ subsets and asks the question whether one (or more) of…
This paper is intended to provide foundations to the theory of Witt-type topological group and ring functors defined on a category of topological algebras, and, in presence of Banach norms, to show how to topologically deal with them. It is…
Szemer\'edi's regularity lemma is a powerful tool in graph theory. It states that for every large enough graph, there exists a partition of the edge set with bounded size such that most induced subgraphs are quasirandom. When the graph is a…
We estimate Gowers uniformity norms for some classical automatic sequences, such as the Thue-Morse and Rudin-Shapiro sequences. The methods can also be extended to other automatic sequences. As an application, we asymptotically count…
In this paper estimates for the uniform norm of solutions of parabolic SPDEs are derived. The result is obtained through iteration techniques, motivated by the work of Moser in deterministic settings. As an application of the main result,…
This paper discusses the possibility of applying the velocity averaging theorems in [F. Golse, P.-L. Lions, B. Perthame, R. Sentis: J. Funct. Anal. 76(1):110--125, 1988] to the Wigner equation governing the quantum evolution of the Wigner…
We study semiorders induced by points drawn from a uniform random distribution. Of particular interest in this paper are the probabilities of generating specific semiorders and the equivalence classes they produce. We present a method for…
We exhibit proofs of two ergodic-theoretic results in the study of multiple recurrence using an analog of the density-increment argument of Roth and Gowers: Furstenberg's Multiple Recurrence Theorem (which implies Szemer\'edi's Theorem),…
A study is made of linear isometries on Fr\'echet spaces for which the metric is given in terms of a sequence of seminorms. This establishes sufficient conditions on the growth of the function that defines the metric in terms of the…
We develop a framework for the study of the limiting behavior of multiple ergodic averages with commuting transformations when all iterates are given by the same sparse sequence; this enables us to partially resolve several longstanding…
We investigate how spectral properties of a measure preserving system $(X,\mathcal{B},\mu,T)$ are reflected in the multiple ergodic averages arising from that system. For certain sequences $a:\mathbb{N}\to\mathbb{N}$ we provide natural…
Solomonoff's central result on induction is that the posterior of a universal semimeasure M converges rapidly and with probability 1 to the true sequence generating posterior mu, if the latter is computable. Hence, M is eligible as a…
Given a graph $H$ on vertex set $\{1,2,\cdots, n\}$ and a function $f:[0,1]^2 \rightarrow \mathbb{R}$, define \begin{align*} \|f\|_{H}:=\left\vert\int \prod_{ij\in E(H)}f(x_i,x_j)d\mu^{|V(H)|}\right\vert^{1/|E(H)|}, \end{align*} where $\mu$…
For integers $k$ and $\ell$, let $\operatorname{ind}(k, \ell)$ be the maximum proportion of $k$-vertex subsets of a large graph that induce exactly $\ell$ edges. The edge-statistics theorem (conjectured by Alon-Hefetz-Krivelevich-Tyomkyn,…