scholarly journals Some properties of periodic modules

1985 ◽  
Vol 38 (3) ◽  
pp. 408-415
Author(s):  
Christine Bessenrodt
Keyword(s):  
Lower Bound ◽  
Group Rings ◽  
Periodic Module ◽  
Rings And Algebras

AbstractIn this paper periodic modules over group rings and algebras are considered. A new lower bound for the p-part of the rank of a periodic module with abeian vertex is given, and results on periodic modules with odd/even and small periods are obtained. In particular, it is shown that characters afforded by periodic lattices of odd period satisfy strong properties and that irreducible periodic lattices are always of even period.

Commutative nil-clean and $\pi$-Regular Group Rings

2019 ◽  
Vol 2019 (3) ◽  
pp. 33-39
Author(s):  
P.V. Danchev
Keyword(s):  
Group Rings ◽  
Regular Group

Network rings and algebras

1959 ◽  
Author(s):  
Jack Morell Anderson
Keyword(s):  
Rings And Algebras

The least distance between extremums and minimal period of solutions to autonomous vector differential equations

2019 ◽  
Vol 485 (2) ◽  
pp. 142-144
Author(s):  
A. A. Zevin
Keyword(s):  
Lower Bound ◽  
Differential Equations ◽  
Periodic Solutions ◽  
Lipschitz Constant ◽  
Minimal Period ◽  
Arbitrary Vector ◽  
Vector Norm ◽  
Sharp Lower Bound

Solutions x(t) of the Lipschitz equation x = f(x) with an arbitrary vector norm are considered. It is proved that the sharp lower bound for the distances between successive extremums of xk(t) equals π/L where L is the Lipschitz constant. For non-constant periodic solutions, the lower bound for the periods is 2π/L. These estimates are achieved for norms that are invariant with respect to permutation of the indices.

A Lower Bound for Schur Numbers and Multicolor Ramsey Numbers

10.37236/1188 ◽  
1994 ◽  
Vol 1 (1) ◽  
Author(s):  
Geoffrey Exoo
Keyword(s):  
Lower Bound ◽  
Lower Bounds ◽  
Ramsey Numbers

For $k \geq 5$, we establish new lower bounds on the Schur numbers $S(k)$ and on the k-color Ramsey numbers of $K_3$.

On the Crossing Number of $K_{m,n}$

10.37236/1748 ◽  
2003 ◽  
Vol 10 (1) ◽  
Author(s):  
Nagi H. Nahas
Keyword(s):  
Lower Bound ◽  
Bipartite Graph ◽  
Complete Bipartite Graph ◽  
Crossing Number

The best lower bound known on the crossing number of the complete bipartite graph is : $$cr(K_{m,n}) \geq (1/5)(m)(m-1)\lfloor n/2 \rfloor \lfloor(n-1)/2\rfloor$$ In this paper we prove that: $$cr(K_{m,n}) \geq (1/5)m(m-1)\lfloor n/2 \rfloor \lfloor (n-1)/2 \rfloor + 9.9 \times 10^{-6} m^2n^2$$ for sufficiently large $m$ and $n$.

Sign in / Sign up

Export Citation Format

Share Document