Finiteness conditions on the Yoneda algebra of a monomial algebra

Let A$A$ be a connected graded noncommutative monomial algebra. We associate to A$A$ a finite graph Γ(A)$\Gamma \left(A\right)$ called the CPS graph of A$A$. Finiteness properties of the Yoneda algebra Ext_A(k,k)${\text{Ext}}_A(k,k)$ including Noetherianity, finite GK dimension, and finite generation are characterized in terms of Γ(A)$\Gamma \left(A\right)$. We show that these properties, notably finite generation, can be checked by means of a terminating algorithm.     

Weak convergence of censored and reflected stable processes

It is shown that if a sequence of open n$n$-sets _Dk$D_k$ increases to an open n$n$-set D$D$ then reflected stable processes in _Dk$D_k$ converge weakly to the reflected stable process in D$D$ for every starting point x$x$ in D$D$. The same result holds for censored α$\alpha$-stable processes for every x$x$ in D$D$ if D$D$ and _Dk$D_k$ satisfy the uniform Hardy inequality. Using the method in the proof of the above results, we also prove the weak convergence of reflected Brownian motions in unbounded domains.     

On Ocneanu's theory of double triangle algebras for subfactors and classification of irreducible connections on the Dynkin diagrams

We give an exposition of Ocneanu's theory of double triangle algebras for subfactors and its application to the classification of irreducible bi-unitary connections on the Dynkin diagrams _An$A_n$, _Dn$D_n$, _E6$E_6$, _E7$E_7$ and _E8$E_8$. More precisely, we give a detailed proof of the complete classification of irreducible K–L$K–L$ bi-unitary connections up to gauge choice, where K and L   represent the two horizontal graphs which are among the A–D–E$A–D–E$ Dynkin diagrams. The result also provides a simple proof of the flatness of _D2n$D_{2n}$, _E6$E_6$ and _E8$E_8$ connections as well as an easy computation of the flat part of _E7$E_7$ as an application.     

Euler class groups and 2-torsion elements

We exhibit an example of a smooth affine threefold A$A$ over a field of characteristic 0$0$ for which there exist non-trivial 2-torsion elements in the Euler class group E(A)$E\left(A\right)$ vanishing in the weak Euler class group _E0(A)$E_0\left(A\right)$. This gives a positive answer to a question of the first author and Raja Sridharan.     

Strong convergence theorems for finitely many nonexpansive mappings

Under the assumption that E$E$ is a reflexive Banach space whose norm is uniformly Gêteaux differentiable and which has a weakly continuous duality mapping _Jφ$J_{\phi }$ with gauge function φ$\phi$, Ceng–Cubiotti–Yao [Strong convergence theorems for finitely many nonexpansive mappings and applications, Nonlinear Analysis 67 (2007) 1464–1473] introduced a new iterative scheme for a finite commuting family of nonexpansive mappings, and proved strong convergence theorems about this iteration. In this paper, only under the hypothesis that E$E$ is a reflexive Banach space which has a weakly continuous duality mapping _Jφ$J_{\phi }$ with gauge function φ$\phi$, and several control conditions about the iterative coefficient are removed, we present a short and simple proof of the above theorem.     

A discrete Fourier transform associated with the affine Hecke algebra

We introduce an explicit representation of the double affine Hecke algebra (of type _A1$A_1$) at q=1$q=1$ that gives rise to a periodic counterpart of a well-known Fourier transform associated with the affine Hecke algebra.     

Tournaments associated with multigraphs and a theorem of Hakimi

A tournament of order n$n$ is usually considered as an orientation of the complete graph _Kn$K_n$. In this note, we consider a more general definition of a tournament that we call aC$C$-tournament, where C$C$ is the adjacency matrix of a multigraph G$G$, and a C$C$-tournament is an orientation of G$G$. The score vector of a C$C$-tournament is the vector of outdegrees of its vertices. In 1965 Hakimi obtained necessary and sufficient conditions for the existence of a C$C$-tournament with a prescribed score vector R$R$ and gave an algorithm to construct such a C$C$-tournament which required, however, some backtracking. We give a simpler and more transparent proof of Hakimi’s theorem, and then provide a direct construction of such a C$C$-tournament which works even for weighted graphs.     

The scaling limit of Poisson-driven order statistics with applications in geometric probability

Let _ηt${\eta }_t$ be a Poisson point process of intensity t≥1$t\ge 1$ on some state space Y$\mathbb{Y}$ and let f$f$ be a non-negative symmetric function on Y^k${\mathbb{Y}}^k$ for some k≥1$k\ge 1$. Applying f$f$ to all k$k$-tuples of distinct points of _ηt${\eta }_t$ generates a point process _ξt${\xi }_t$ on the positive real half-axis. The scaling limit of _ξt${\xi }_t$ as t$t$ tends to infinity is shown to be a Poisson point process with explicitly known intensity measure. From this, a limit theorem for the m$m$-th smallest point of _ξt${\xi }_t$ is concluded. This is strengthened by providing a rate of convergence. The technical background includes Wiener–Itô chaos decompositions and the Malliavin calculus of variations on the Poisson space as well as the Chen–Stein method for Poisson approximation. The general result is accompanied by a number of examples from geometric probability and stochastic geometry, such as k$k$-flats, random polytopes, random geometric graphs and random simplices. They are obtained by combining the general limit theorem with tools from convex and integral geometry.