Root Systems In Finite Symplectic Vector Spaces

We study realizations of root systems in possibly degenerate symplectic vector spaces over finite fields, up to symplectic isomorphisms. The main result of this article is the classification of such realizations for the field 𝔽₂. Thereby, each root system requires a specific degree of degeneracy of the symplectic vector space. Our main motivation for this article is that for each such realization of a root system we can construct a Nichols algebra over a nonabelian group.     

Ideal Structure of Leavitt Path Algebras with Coefficients in a Unital Commutative Ring

For a (countable) graph E and a unital commutative ring R, we analyze the ideal structure of the Leavitt path algebra L _R (E) introduced by Mark Tomforde. We first modify the definition of basic ideals and then develop the ideal characterization of Mark Tomforde. We also give necessary and sufficient conditions for the primeness and the primitivity of L _R (E), and we then determine prime graded basic ideals and left (or right) primitive graded ideals of L _R (E). In particular, when E satisfies Condition (K) and R is a field, they imply that the set of prime ideals and the set of primitive ideals of L _R (E) coincide.     

积和式及行列式的一个推广

基于对积和式性质的讨论,给出了积和式的"化长为方"计算方法;基于对积和式概念的研究,作为行列式的推广,给出了一般m×n矩阵的行式定义,讨论了行式的性质和计算方法,推广了克莱姆法则.     

效应代数的表示理论

The aim of this paper is to characterize representable and weak representable effect algebras and establish a representation theory of effect algebras. An effect algebra E is said to be representable if there exists a Hilbert space H and a monomorphism π from E into the Hilbert space effect algebra ε(H) and it is said to be weakly representable if there exists an injective morphism from E into some ε(H). It is proved that an effect algebra E with the nonempty state space S(E) is representable if and only if x, y ∈ E, f(x)+f(y) ≤ 1 implies x⊕y is defined; it is weakly representable if and only if the state space S(E) separates the points of E. Some operational properties of representable effect algebras are established, and some applications of the obtained results are listed.     

Research Article: On Extending Primal-Dual Interior-Point Method for Linear Optimization to Convex Quadratic Symmetric Cone Optimization

Disjoint frames are interesting frames in Hilbert spaces, which were introduced by Han and Larson in [4 D. Han and D. R. Larson ( 2000 ). Frames, Basis and Group Representations . Memoirs of the American Mathematical Society, No. 679. AMS, Providence, RI.  [Google Scholar]]. In this article, we use disjoint frames to construct frames. In particular, we obtain some conditions for the linear combinations of frames to be frames where the coefficients in the combination may be operators. Our results generalize the corresponding results obtained by Han and Larson. Finally, we provide some examples to illustrate our constructions.     

Automating the Partition of Indexes

Abstract

In this article we show how attention to the structure of a particular algebraic calculation can lead to the simple implementation of powerful computer algebra tools. The creation of partitions for a set of indexes is required for the implementation of many theoretical structures. This may be difficult to do by hand even when the number of indexes is only moderately large. These partitions arise through the action of differentiation and so we mimic differentiation in a computer algebra package to create partitions of indexes. The strategies employed are extended to the creation of complementary set partitions, their reduction to equivalence classes, and the implementation of Edgeworth expansions and the exlog relations.     

套代数上的可加双导子和中心化映射

令$\mathcal N$是Banach空间$X$上的套, Alg$\mathcal N$是相应的套代数. 本文证明了, 如果套$\mathcal N$中存在非平凡元$N$在$X$中可补, 且$\dim N\not=1$, 则Alg$\mathcal N$上的每个可加双导子是内导子. 作为此定理的应用, 分别给出了套代数上中心化(交换)映射, 斜中心化导子以及斜交换的广义导子的具体刻画.     

Pruned discrete random samples

Let $X_i,i\in \mathbb{N}$, be independent and identically distributed random variables with values in ${\mathbb{N}}_0$. We transform (‘prune’) the sequence $\{X_1,\dots ,X_n\},n\in \mathbb{N}$, of discrete random samples into a sequence $\{0,1,2,\dots ,Y_n\},n\in \mathbb{N}$, of contiguous random sets by replacing $X_{n+1}$ with $Y_n+1$ if $X_{n+1}>Y_n$. We consider the asymptotic behaviour of $Y_n$ as $n\to \infty$. Applications include path growth in digital search trees and the number of tables in Pitmanʼs Chinese restaurant process if the latter is conditioned on its limit value.