Elliptic fibers over non-perfect residue fields

Kodaira and Néron classified and described the geometry of the special fibers of the Néron model of an elliptic curve defined over a discrete valuation ring with a perfect residue field. Tate described an algorithm to determine the special fiber type by manipulating the Weierstrass equation. In the case of non-perfect residue fields, we discover new fiber types which are not on the Kodaira-Néron list. We describe these new types and extend Tate's algorithm to deal with all discrete valuation rings. Specifically, we show how to translate a Weierstrass equation into a form where the reduction type may be easily determined. Having determined the special fiber type, we construct the regular model of the curve with explicit blow-up calculations. We also provide tables that serve as a simple reference for the algorithm and which succinctly summarize the results.     

A Representation of a Family of Secret Sharing Matroids

Deciding whether a matroid is secret sharing or not is a well-known open problem. In Ng and Walker [6] it was shown that a matroid decomposes into uniform matroids under strong connectivity. The question then becomes as follows: when is a matroid m with N uniform components secret sharing? When N = 1, m corresponds to a uniform matroid and hence is secret sharing. In this paper we show, by constructing a representation using projective geometry, that all connected matroids with two uniform components are secret sharing     

MILO中场不稳定性的非线性发展及混沌行为

 以磁绝缘传输线振荡器中电子运动和辐射场演化方程为基础，分析了场与电子相互作用过程中的不稳定性。这种不稳定性的发展导致场出现极限环振荡和混沌。在软非线性区域，辐射场表现为不连续的极限环振荡；在硬非线性区域，辐射场表现为连续的混沌行为。控制失谐量可加速或抑制这些不稳定态的出现。优化和调节参数可控制器件的运行状态, 获得较高的输出功率。     

Synthesis and cell cycle inhibition of the peptide enamide natural products terpeptin and the aspergillamides

Total syntheses of the peptide enamide natural products terpeptin and aspergillamides A and B are reported. An oxidative decarboxylation-elimination protocol is employed to construct the indolic enamide moiety. Unambiguous stereochemical assignment of (−)-terpeptin is accomplished by synthesis of all possible stereochemical analogues. Select compounds have been evaluated in cell cycle inhibitor assays which show that the natural amino acid configuration of terpeptin has the most potent inhibitory activity.     

Q-正则Loewner空间中的拟对称映射

本文在Q-正则Loewner空间中用环模不等式刻划了拟对称映射.另外,在 Q-维Ahlfors-David正则空间中建立了拟对称映射作用下的Grotzsch-Teichmuller型 模不等式,它是通过伸张系数的积分平均来表示.     

Constructing two-weight codes with prescribed groups of automorphisms

We construct new linear two-weight codes over the finite field with q elements. To do so we solve the equivalent problem of finding point sets in the projective geometry with certain intersection properties. These point sets are in bijection to solutions of a Diophantine linear system of equations. To reduce the size of the system of equations we restrict the search for solutions to solutions with special symmetries.Two-weight codes can be used to define strongly regular graphs. We give tables of the two-weight codes and the corresponding strongly regular graphs. In some cases we find new distance-optimal two-weight codes and also new strongly regular graphs.     

在对称群Sm中解循环方程组

本文研究了在对称群S_m中解循环方程组:x_mX_(m+1)…x_(ω+k-1)σ_m,其中σ_m∈S_m,ω=1,2,…,s,确定了这个循环方程组有解的充分必要条件和解的个数,而且给出了求解过程。     

PANCYCLICITY IN LINE GRAPHS

1IntroductionWeuseBondyandMurtyl3]forterminologyand..ta'ti..notdefinedhereandconsidersimpleconnectedgraphsonly.AcircuitCofagraphGisanontrivialconnectedeuleriansubgraphofG.Aspanningcircuit,orbrieflyS-circuit,ofagraphGisacircuitthatcontainsallvenicesofG.AdominatingcircuitorD-circuitofGisacircuitsuchthateveryedgeofGisincidentwithatleastonevertexofthecircuit.AgraphofordernispancyclicifitcontainsallcyclesoflengthIfor3515n.IfCisacircuitofG,thenP(C)denotesthenumberOfedgesofGincidentwithatleas…     

The Choquet-Deny convolution equation μ=μ*σ for probability measures on Abelian semigroups

In this note, we characterize the regular probability measures satisfying the Choquet-Deny convolution equation =* on Abelian topological semigroups for a given probability measure .     

Diagrams,orientations, and varieties

One of the central problems in the theory of ordered sets is to describe the orientations of the covering graph of an ordered set. We show that the particular operation called inversion, together with the classical constructions of retraction and product, provide a context for the classification of all such orientations. AMS subject classifications (1980). 06A10, 05C75, 05C20.