关于群的阶与共轭类数

讨论群的共轭数与群阶的关系,获得两个新的数量不等式,同时改进了一些相关的已知结果。     

“关灯”游戏中的代数学

研究的是来自互联网上的一个有趣的数学游戏,运用数学建模的方法给出了其基于有限域上的线性方程组的数学模型,对n=5的情形给出了所有解.并进一步,运用代数学的“分类”方法给出了游戏的四个等价类的直观描述,使游戏者不用解方程组就能立即判断出该“残局”能够变为哪个类型.     

Recognition by spectrum for finite simple linear groups of small dimensions over fields of characteristic 2

Two groups are said to be isospectral if they share the same set of element orders. For every finite simple linear group L of dimension n over an arbitrary field of characteristic 2, we prove that any finite group G isospectral to L is isomorphic to an automorphic extension of L. An explicit formula is derived for the number of isomorphism classes of finite groups that are isospectral to L. This account is a continuation of the second author's previous paper where a similar result was established for finite simple linear groups L in a sufficiently large dimension (n > 26), and so here we confine ourselves to groups of dimension at most 26. Supported by RFBR (project Nos. 08-01-00322 and 06-01-39001), by SB RAS (Integration Project No. 2006.1.2), and by the Council for Grants (under RF President) and State Aid of Leading Scientific Schools (grant NSh-344.2008.1) and Young Doctors and Candidates of Science (grants MD-2848.2007.1 and MK-377.2008.1). Translated from Algebra i Logika, Vol. 47, No. 5, pp. 558–570, September–October, 2008.     

Elementary Properties of Cycle-free Partial Orders and their Automorphism Groups

A classification was given by Creed, Truss, and Warren of all the countable k-CS-transitive cycle-free partial orders for k3. Here the elementary theories of these structures and their automorphism groups are examined, and it is shown that in many cases we can distinguish the structures or their groups by means of their first- or second-order properties. The small index property is established for weakly 2-transitive trees, and for several classes of cycle-free partial orders.     

达到极大线性复杂度的前馈阵列

讨论了三类达到极大线性复杂度的前馈阵列的输入阵列的结构。一类是达到极大线性复杂度的乘积前馈阵列,完全确定了其输入阵列的结构;给出了两类输入阵列,证明了它们的任意前馈阵列达到极大线性复杂度。     

两类重要p-群及其自同构群的阶

In the paper we obtain two infinite classes of p-groups,calculate the orders of their automorphism groups and correct a mistake(perhaps misprinted)of Rodney James'paper in 1980.     

余代数上的Green等价

本文在余代数上定义了五类等价关系,它们是Ｇｒｅｅｎ等价Ｇ,Ｄ,Ｌ,Ｒ,Ｈ．然 后给出了这些等价关系一些基本性质和结构特点．在每个Ｇｒｅｅｎ等价的等价类集上构 造了一种偏序并给出了偏序上半格和格结构的刻划．用Ｇ－,Ｌ－,Ｒ－类分别给出了子余 代数、左余理想、右余理想的结构刻划．进一步地,本文研究了张量积上的Ｇｒｅｅｎ等 价以及余代数同态的Ｇｒｅｅｎ保持性和提升性．作为应用,本文得到了两个不可约余代 数的张量积仍为不可约余代数的一个条件;证明了不可约余代数在Ｇ－保持余代数同 态下的同态像是不可约的．     

关于有限向量集的一类三角不等式及应用

本文引入了Ｅⁿ中ｒ阶空间角的概念,建立了有限向量集的一类三角不等式．作为其应用,得到了ｎ维单形的两类三角不等式,推广和改进了一些已有文献中的主要结果．     

Pure quantitative characterization of linear groups over the binary field

The purpose of this paper is to discuss the pure scalar characterization of the automorphism group Aut (L ₅(2)) and the linear group L ₆(2). It is proved that Aut(L ₅(2)) and L ₆(2) can be characterized quantitatively by the set of element orders. The main results are obtained by using William’s work on prime graph components of finite groups and Brauer characters in trivializing the possible 2-subgroups. __________ Translated from Chinese Annals of Mathematics, 2003, 24A(6): 675–682. This work was supported by the National Natural Science Foundation of China under grant number 10171074     

可控自然序富足半群

本文研究可控自然序富足半群,文中给出两类可控自然序富足半群的结构。     

Two logical hierarchies of optimization problems over the real numbers

We introduce and study certain classes of optimization problems over the real numbers. The classes are defined by logical means, relying on metafinite model theory for so called R‐structures (see [12, 11]). More precisely, based on a real analogue of Fagin's theorem [12] we deal with two classes MAX‐NPR and MIN‐NPR of maximization and minimization problems, respectively, and figure out their intrinsic logical structure. It is proven that MAX‐NPR decomposes into four natural subclasses, whereas MIN‐NPR decomposes into two. This gives a real number analogue of a result by Kolaitis and Thakur [13] in the Turing model. Our proofs mainly use techniques from [17]. Finally, approximation issues are briefly discussed. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Biderivations,linear commuting maps and commutative post-Lie algebra structures on W-algebras

In this paper, the biderivations without the skew-symmetric condition of W-algebras including the Witt algebra, the algebra W(2,2) and their central extensions are characterized. Some classes of non-inner biderivations are presented. As applications, the forms of linear commuting maps and the commutative post-Lie algebra structures on aforementioned W-algebras are given.     

Krylov Subspaces Associated with Higher-Order Linear Dynamical Systems

A standard approach to model reduction of large-scale higher-order linear dynamical systems is to rewrite the system as an equivalent first-order system and then employ Krylov-subspace techniques for model reduction of first-order systems. This paper presents some results about the structure of the block-Krylov subspaces induced by the matrices of such equivalent first-order formulations of higher-order systems. Two general classes of matrices, which exhibit the key structures of the matrices of first-order formulations of higher-order systems, are introduced. It is proved that for both classes, the block-Krylov subspaces induced by the matrices in these classes can be viewed as multiple copies of certain subspaces of the state space of the original higher-order system. AMS subject classification (2000) 65F30, 15A57, 65P99, 41A21     

SO(∀∃*) Sentences and Their Asymptotic Probabilities

We prove a 0‐1 law for the fragment of second order logic SO(∀∃*) over parametric classes of finite structures which allow only one unary atomic type. This completes the investigation of 0‐1 laws for fragments of second order logic defined in terms of first order quantifier prefixes over, e.g., simple graphs and tournaments. We also prove a low oscillation law, and establish the 0‐1 law for Σ¹₄(∀∃*) without any restriction on the number of unary types.     

有限元网格的超收敛测度及其应用

给出线性有限元求解二阶椭圆问题的有限元网格超收敛测度及其应用.有限元超收敛经常是在具有一定结构的特殊网格条件下讨论的,而本文从一般网格出发,导出一种网格的范数用来描述超收敛所需要的网格条件以及超收敛的程度.并且通过对这种网格范数性质的考察,可以证明对于通常考虑的一些特殊网格的超收敛的存在性.更进一步,我们可以通过正则细分的方式在一般区域上也可以自动获得超收敛网格.最后给出相关的数值结果来验证本文的理论分析.     

On Counting Certain Abelian Varieties Over Finite Fields

This paper contains two parts toward studying abelian varieties from the classification point of view. In a series of papers[Doc. Math., 21, 1607-1643 (2016)],[Taiwanese J. Math., 20(4), 723-741 (2016)], etc., the current authors and T. C. Yang obtain explicit formulas for the numbers of superspecial abelian surfaces over finite fields. In this paper, we give an explicit formula for the size of the isogeny class of simple abelian surfaces with real Weil number q. This establishes a key step that extends our previous explicit calculation of superspecial abelian surfaces to those of supersingular abelian surfaces. The second part is to introduce the notion of genera and idealcomplexes of abelian varieties with additional structures in a general setting. The purpose is to generalize the previous work by the second named author[Forum Math., 22(3), 565-582 (2010)] on abelian varieties with additional structures to similitude classes, which establishes more results on the connection between geometrically defined and arithmetically defined masses for further investigations.     

Free Triangle Orders

We define a new class of ordered sets, called free triangle orders. These are ordered sets represented by a left-to-right ordering on geometric objects contained in a horizontal strip in the plane. The objects are called 'free triangles', and have one vertex on each of the two boundaries of the strip and one vertex in its interior. These ordered sets generalize the classes of trapezoid and triangle orders studied by Bogart, Möhring, and Ryan, represented by trapezoids and triangles respectively, contained within a strip in the plane, and are a special case of the orders of tube dimension 2 introduced by Habib and co-workers, which are represented by any set of convex bodies contained within a strip in the plane. Our main result is that the class of free triangle orders strictly contains the class of trapezoid orders.     

Characteristic classes of almost-flag structures

The aim of this paper is to present a basic theory of characteristic classes of almost-flag structures. Vanishing theorems for primary characteristic classes of almost-flag and almost-product structures are proved. Consequences of these theorems for secondary characteristic classes are drawn in the framework of Lehmann's theory. Two theorems on residues of flag structures complete the paper.     

Order Varieties and Monotone Retractions of Finite Posets

In this paper we introduce a new version of the concept of order varieties. Namely, in addition to closure under retracts and products we require that the class of posets should be closed under taking idempotent subalgebras. As an application we prove that the variety generated by an order-primal algebra on a finite connected poset P is congruence modular if and only if every idempotent subalgebra of P is connected. We give a polynomial time algorithm to decide whether or not a variety generated by an order-primal algebra admits a near unanimity function and so we answer a problem of Larose and Zádori.     

High‐order asymptotic‐preserving schemes for linear systems: Application to the Goldstein–Taylor equations

In this work, we address the numerical approximation of linear systems with possibly stiff source terms which induce an asymptotic diffusion limit. More precisely, we are interested in the design of high‐order asymptotic‐preserving schemes. Our approach is based on a very simple modification of the numerical flux associated with the usual HLL scheme. This alteration can be understood as a numerical diffusion reduction technique and allows to capture the correct asymptotic behavior in the diffusion limit and to consider uniformly high‐order extensions. We more specifically consider the case of the Goldstein–Taylor model but the overall approach is shown to be easily adapted to more general systems.