相关论文: Minimal elements of stopping time $\sigma$-algebra…
Using combinatorics of chains going back to works of Anick, Green, Happel and Zacharia, we give, for any monomial algebra $A$, an explicit description of its minimal model. This also provides us with formulas for a canonical…
Let $\Sigma$ be a surface with negative Euler characteristic, genus at least one and at most one boundary component. We prove that the skein algebra of $\Sigma$ over the field of rational functions can be algebraically generated by a finite…
Join-preserving maps on the discrete time scale $\omega^+$, referred to as time warps, have been proposed as graded modalities that can be used to quantify the growth of information in the course of program execution. The set of time warps…
In a temporal graph, each edge is available at specific points in time. Such an availability point is often represented by a ''temporal edge'' that can be traversed from its tail only at a specific departure time, for arriving in its head…
We prove a convolution formula for the conjugacy classes in symmetric groups conjectured by the second author. A combinatorial interpretation of coefficients is provided. As a main tool we introduce new semigroup of partial permutations. We…
We consider sequences of finitely generated discrete subgroups Gamma_i=rho_i(Gamma) of a rank 1 Lie group G, where the representations rho_i are not necessarily faithful. We show that, for algebraically convergent sequences (Gamma_i),…
We get a continuous one-parameter new family of embedded minimal surfaces, of which the period problems are two-dimensional. Moreover, one proves that it has Scherk second surface and Hoffman-Wohlgemuth example as limit-members.
A standard tool for classifying the complexity of equivalence relations on $\omega$ is provided by computable reducibility. This reducibility gives rise to a rich degree structure. The paper studies equivalence relations, which induce…
In this paper, we associate, to any submartingale of class $(\Sigma)$, defined on a filtered probability space $(\Omega, \mathcal{F}, \mathbb{P}, (\mathcal{F}_t)_{t \geq 0})$, which satisfies some technical conditions, a $\sigma$-finite…
We suggest a new algorithm for finding a canonical representative of a given braid, and also for the harder problem of finding a $\sigma_1$-consistent representative. We conjecture that the algorithm is quadratic-time. We present numerical…
We associate reduced and full C*-algebras to arbitrary rings and study the inner structure of these ring C*-algebras. As a result, we obtain conditions for them to be purely infinite and simple. We also discuss several examples.…
Let $M$, $N$, $R$ be $W^{*}$--algebras, with $R$ unitally embedded in both $M$ and $N$. by using Reduction Theory, we extend the previous description of the $W^{*}$--tensor product $M\bar\otimes_{R}N$ over the common $W^{*}$--subalgebra $R$…
Let $\psi$ be a permutation of a finite set $X$. We define $\lambda(\psi)$ to be the largest fraction of elements of $X$ lying on a single cycle of $\psi$. For a finite group $G$, we define $\lambda(G)$ to be the maximum among the values…
We over-approximate reachability sets in string rewriting by languages defined by admissible factors, called tiles. A sparse set of tiles contains only those that are reachable in derivations, and is constructed by completing an automaton.…
Dirichlet's version of Gauss's reduction theory for indefinite binary quadratic forms includes a map from Gauss-reduced forms to strings of natural numbers. It attaches to a form the minimal period of the continued fraction of a quadratic…
Persistence in coarsening 1D spin systems with a power law interaction $r^{-1-\sigma}$ is considered. Numerical studies indicate that for sufficiently large values of the interaction exponent $\sigma$ ($\sigma\geq 1/2$ in our simulations),…
We identify the integrable stopping time $\tau_*$ with minimal $L^1$-distance to the last-passage time $\gamma_z$ to a given level $z>0$, for an arbitrary non-negative time-homogeneous transient diffusion $X$. We demonstrate that $\tau_*$…
In this note, we investigate how different fundamental groups of presentations of a fixed algebra $A$ can be. For finitely many finitely presented groups $G_i$, we construct an algebra $A$ such that all $G_i$ appear as fundamental groups of…
Our main result is a recognition principle for iterated suspensions as coalgebras over the little disks operads. Given a topological operad, we construct a comonad in pointed topological spaces endowed with the wedge product. We then prove…
Infinite words, also known as streams, hold significant interest in computer science and mathematics, raising the natural question of how their complexity should be measured. We introduce cellular automaton reducibility as a measure of…