Skip to main content

AADS 1

Featured

DeSoc and Decentralised Blogging Platforms - INLEO - Non-Elaborate Posts - Post 1

   When a participant elects to relocate their LEO tokens across disparate blockchain networks, INLEO’s system implements a trust-minimized locking and minting (and conversely, burning and unlocking) architecture: specifically, a user deposits native LEO tokens into a cryptographic smart contract or analogous lock-module on the source chain; that contract irrevocably locks (escrows) those tokens, thereby removing them from liquid circulation on that origin chain. In response, an equivalent number of “wrapped” tokens (for example, wLEO on Ethereum, bLEO on Binance Smart Chain, or pLEO on Polygon) are algorithmically minted (or issued) on the target chain, subject to provable attestations via oracles or cross-chain relay/bridge protocols. If the user later desires reconversion, the wrapped tokens are irreversibly burned on the target chain, and the previously locked native tokens are released back to the user’s address on the source chain. This bi-directional mint-burn / lock-un...

Mathematical finite p-groups with at most equation subgroups not in Chermak-Delgado lattice

 

Mathematical finite p-groups with at most equation subgroups not in Chermak-Delgado lattice

 

What groups are

      In order for a set or system of elements to be called a mathematical group it needs to satisfy the following properties:

1.Closure

      If there is a group G and elements equation then equation .       

Or                                                                                                                                   

      If there is a group G and elements equation then equation.

2.Associativity

      If there is a group G and elements equation then equation .

3.Inverse for every element

      If there is a group G and element equation and has inverse equation where equation.                                             Or                                                                                                                                   

      If there is a group G and element equation and has inverse equation where equation.

4.Identity element

      If there is a group G and element equation and has inverse equation where equation and equation where equation is the identity element.

What p-groups are

      A group G is a p-group if the order of the group is a power of a prime i.e. p. Throughout evolving actions or operations will a group of order equation where equation doesn't divide at equation, and equation is the highest power of  dividing |G|.

P-group lemma:                                                                                                                                                  If the p-group G acts on a set A via equation, then: equation.

Normalizer lemma:                                                                                                                                              If H is a p-subgroup of G and if the normalizer is equation then, equation.

Finite p-groups with at most  subgroups not in Chermak-Delgado lattice

      Lattices are an important subject and aspect in mathematics as well as useful for the applications lattice theory offer to physics applied mathematics and other sciences and other subjects. They help define order and through order, relations, chains and sets as well as other other things they are defined. The Chermak–Delgado lattice of G, denoted 𝒞𝒟(G), is the set of all subgroups with maximal Chermak–Delgado measure; this set is a modular sublattice within the subgroup lattice of G.

      Suppose that G is a finite group, and H is a subgroup of G. The Chermak-Delgado measure of H (in G) is denoted by mG(H), and defined as mG(H) = |H| · |CG(H)|. The maximal Chermak-Delgado measure of G is denoted by m∗ (G), and defined as 

                                 m∗ (G) = max{mG(H) | H ≤ G}.

      Let 

. Then the set CD(G) forms a sublattice of L(G), the subgroup lattice of G, and is called the Chermak-Delgado lattice of G.

      Following D. Burrell, W. Cocke and R. McCulloch [13], we use δCD(G) to denote the number of subgroups of G not in CD(G). That is, 

                                δCD(G) = |L(G)| − |CD(G)|. 

      Our main result is stated as follows:

      Let G be a finite p-group. Then δCD(G) 6 p 2 + p if and only if G is one of the following groups: 

(1) Cp k , where k = 1, 2, . . . , equation+ p; (In this case, δCD(G) = k.) 

(2) Cp t × Cp, where t = 1, 2, . . . , p − 1; (In this case, δCD(G) = t(p + 1) + 1.) 

(3) Q8; (In this case, δCD(G) = 1.) 

(4) ha, b | a p k = b p = 1, ab = a 1+p k−1 i, where k = 2, 3, . . . , p + 1. (In this case, δCD(G) = (k − 1)(p + 1).)

Comments

Popular Posts