One-dimensional local rings with reduced associated graded ring and their Hilbert functions

Let A be a one-dimensional reduced local ring with finite normalization. Let G(A) be the associated graded ring of A. In this paper we analyse the two conditions: Proj (G(A)) reduced and G(A) reduced together with their relations with the equality H(n)=H_R (n), where H(n) and H_R (n) are respectively the Hilbert function of the ring A and of the local ring R of G(A)_red=G(A)/nil (G(A)) at its homogenous maximal ideal. As a consequence of our results we get a class of ordinary singularities with H(n) locally decreasing for any embedding dimension H(1) greater then 4.     

一类完全三部图的色唯一性

用P(G,λ)表示简单图G的色多项式.设G是一个给定的简单图,若对任意简单图H,当P(H,λ)=P(G,λ)时都有H和G同构(记为H≌G),则称图G是色唯一的.本文证明了以下结果:设n,k,△都为非负整数,其中k≥0,△∈{4,5},若n≥1/3k~2+1/3△~2-1/3k△-1/3k-1/3△+4/3,则完全三部图K(n,n+△,n+k)是色唯一的.同时还给出了一个猜想.     

几类图的匹配唯一性

若图G的匹配多项式为M(G;W),对任何图H,M(G;W)=M(H;W)推出G与H同构,则称G是匹配唯一的.本文讨论了下面的几种图类:(i)B_(m,n,r);(ii)D_(m,n,r);(iii)T_(m,n)的匹配唯一性问题,从而得到一些较为满意的结果.     

关于图中子图的（n,k）—正交因子分解

设G是一个具有顶点集V(G)和边集E(G)的图. 设g和f是定义在V(G)上的两个整数值函数,使得g(x)f(x)对所有的点x∈V(G)都成立.如果G是一个(mg+n,mf-n)-图,1n<m2k,且g(x)2k-1对所有的点x∈V(G)都成立,则对任意给定具有|E(H)|=nk边的G的子图H,存在G的一个子图G′使G′有一个(g,f)-因子分解(n,k)-正交H.     

Graham’s pebbling conjecture on product of complete bipartite graphs

The pebbling number of a graph G, f(G), is the least n such that, no matter how n pebbles are placed on the vertices of G, we can move a pebble to any vertex by a sequence of moves, each move taking two pebbles off one vertex and placing one on an adjacent vertex. Graham conjectured that for any connected graphs G and H, f( G x H) ⩽ f( G) f( H). We show that Graham’s conjecture holds true of a complete bipartite graph by a graph with the two-pebbling property. As a corollary, Graham’s conjecture holds when G and H are complete bipartite graphs.     

On Groups with a CC(n)-Subgroup

A subgroup H of G is a CC(n)-subgroup of G if |G: H| >n and |C_G(x): C_H(x)| ≤n for each element x ∈ H ? {1}. In this article, we study the finite p-groups with a nontrivial CC(p)-subgroup, and the locally nilpotent groups with a nontrivial CC(n)-subgroup.     

Frobenius Partitions in Extraspecial Groups

Let K be a field and G be the group of the upper unitriangular (n + 2) × ( n + 2) K-matrices with nonzero entries only in the first row and in the last column. Then G has a normal subgroup N with a complement H which are K-vector spaces respectively of dimensions n + 1 and n. In the present paper we show that the orbit of H under a group of automorphisms of G together with N, forms a partition of G, provided that there exists a commutative (possibly nonassociative) division algebra of dimension n + 1 over K. This algebra exists when K is a finite field.     

图有含(或不含)特殊边的[a,b]-因子的邻域条件

设G是一个n阶图.设1≤a＜b是整数.设H1和H2是G的任意两个边不交子图,它们分别具有m1和m5条边,以及δ(G)表示最小度.证明了若δ(G)≥a+m 2,n≥2(d+b-m2)(a+b-m1-1)/(b-m1),a≤b-(m1+m2),并且|NG(x)UNG(y)|≥an/(d+b-m1)+2m2对任意两个不相邻的顶点x和y成立,那么G有[a,b]-因子F使得F含有H1的边并不含H3的边.     

图有特殊[a,b]-因子的度条件

设G是一个n阶图 .设 1 a 相似文献   

圈的中间图pebbling数和Graham猜想

图G的一个pebbling移动是从一个顶点移走2个pebble, 而把其中的1个pebble移到与其相邻的一个顶点上. 图G 的pebbling数f(G)是最小的正整数n, 使得不论n个pebble 如何放置在G的顶点上, 总可以通过一系列的pebbling移动, 把1个pebble移到图G的任意一个顶点上. 图G 的中间图M(G) 就是在G 的每一条边上插入一个新点, 再把G 上相邻边上的新点用一条边连接起来的图. 对于任意两个连通图G和H, Graham猜测f(G\times H)\leq f(G)f(H). 首先研究了圈的中间图的pebbling 数, 然后讨论了一些圈的中间图满足Graham猜想.     

(g,f) -因子和可扩图

设G是一个图,并设g和f是定义在V(G)上的整值函数使得对所有的点x∈ V(G)均有g(x)≤ f(x).称一个图G是(g,f,H) -可扩的,如果在删除了任意一个同构于H的子图中所有点后,剩下G的子图有一个(g,f) -因子.该文给出了(g,f,H) -可扩图的特征.进一步,研究了(g,f,H) -可扩(H=nK₁)的性质.     

本原简单超图的指数集

设H是一个超图, 用H\+*和L(H)分别表示H的对偶超图和线图. 定义H的邻接图是由L(H\+*)和H的所有环组成的图, 记作G\-H. 若G\-H是本原的, 则称H是本原的, 并称γ(G\-H)为H的指数. 该文得到了所有n阶本原简单超图以及所有秩不小于3的n阶本原简单超图的指数集, 并分别刻划了其极超图.     

含有大的悬挂树图的Ramseygoodness结论(英文)

设H是阶为n的连通图.在H的某一个顶点上悬挂一棵阶为j的树,得到图H_j,用H_j表示这样的图形族.本文证明:当j充分大时,有r(G,H_j)=(x(G)-1)(n+j-1)+s(G),其中x(G),s(G)分别表示图G的色数和色数剩余.     

2—（v,7,1） 设计的可解区传递自同构群

设G是一个2－（v,7,1)设计的可解区传递自同构群,则G是点－本原,且下列之一成立：（1）v=7^n,G是旗－传递的;（2）v=5^6,G=Z5^6:H,这里H是GL（6,5）的可解且不可约的子群;（3）v=p^n,P≤ALT(1,p^n)。特别地,p≠2且p^n≡1(mod42)。     

若干完全三部图的色唯一性

用P(G,λ)表示图G的色多项式.若对任意图H,当P(H,λ)=P(G,λ)时都有H和G同构,则称图G是色唯一的.给出了以下结果:m≥2且k≥0时,完全三部图K(m,m,m+k)是色唯一的;m≥2且m+1>k≥0时,完全三部图K(m,m+1,m+k)是色唯一的.     

應用正二次微分形式的理論於映照半徑之乘積

<正> §1.設G是z平面上的一個區域,a_1,a_2,…,a_n是G中的n個不同的有限點.G_1,…,G_n是G中的一組不相重叠的單連區域,a_ν∈G_ν(ν=1,2,…,n).又設x_1,x_2,…,x_n是一組正數.設R(a_ν,G_ν)是區域G_ν在a_ν的映照半徑,則R(a_ν,G_ν)≤≤4|a_ν—a_ν′|,(ν’≠ν).因此,當n>1時G_1,G_2,…,G_n儘管變動,     

Oscillation of higher order neutral functional difference equations with positive and negative coefficients

Sufficient conditions are obtained so that every solution of the neutral functional difference equation

On non-Abelian homomorphic public-key cryptosystems

An important problem of modern cryptography concerns secret public-key computations in algebraic structures. We construct homomorphic cryptosystems, which are (secret) epimorphisms f : G H, where G and H are (publically known) groups and H is finite. A letter of a message to be encrypted is an element h H, while its encryption is an element g G such that f(g) = h. A homomorphic cryptosystem allows one to perform computations (in the group G) with encrypted information (without knowing the original message over H).In this paper, homomorphic cryptosystems are constructed for the first time for non-Abelian groups H (earlier, homomorphic cryptosystems were known only in the Abelian case). In fact, we present such a system for any (fixed) solvable group H. Bibliography: 24 titles.Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 293, 2002, pp. 39–58.This revised version was published online in April 2005 with a corrected cover date and article title.     

QUASI-PERMUTATION REPRESENTATIONS OF ALTERNATING AND SYMMETRIC GROUPS

The quantities c(G), q(G) and p(G) for finite groups were defined by H. Behravesh. In this article, these quantities for the alternating group An and the symmetric group Sn are calculated. It is shown that c(G) = q(G)=p(G) = n, when G = An or Sn.     

On Complemented Subgroups of Finite Groups

51. IntroductionIt is quite clear that the ekistence of complements for some families of subgroups of agroup gives a lot ofinfor~ion about its structure. FOr instance, Hall[6] proved that a groupG is supersoluble with elementary abelian Sylow subgroups if and only if G is complemellted,that is, every subgroup of G is comPlemeded in G. The same anchor also proved that agroup is soluble if and only if every Sylow subgroup is complemellted (see [3;I,3.5]). Morerecelltly, Arad and Wardll] pro…