Search results for "combinatoric"

Fields of values of odd-degree irreducible characters

2019

Abstract In this paper we clarify the quadratic irrationalities that can be admitted by an odd-degree complex irreducible character χ of an arbitrary finite group. Write Q ( χ ) to denote the field generated over the rational numbers by the values of χ, and let d > 1 be a square-free integer. We prove that if Q ( χ ) = Q ( d ) then d ≡ 1 (mod 4) and if Q ( χ ) = Q ( − d ) , then d ≡ 3 (mod 4). This follows from the main result of this paper: either i ∈ Q ( χ ) or Q ( χ ) ⊆ Q ( exp ⁡ ( 2 π i / m ) ) for some odd integer m ≥ 1 .

Inequalities for Information Potentials and Entropies

2020

We consider a probability distribution p0(x),p1(x),&hellip

Radical Rings with Soluble Adjoint Groups

2002

Abstract An associative ring R , not necessarily with an identity, is called radical if it coincides with its Jacobson radical, which means that the set of all elements of R forms a group denoted by R ∘ under the circle operation r  ∘  s  =  r  +  s  +  rs on R . It is proved that every radical ring R whose adjoint group R ∘ is soluble must be Lie-soluble. Moreover, if the commutator factor group of R ∘ has finite torsion-free rank, then R is locally nilpotent.

2020

Abstract We show that the combination of doubling and (1, p)-Poincaré inequality is equivalent to a version of the Ap-condition on rooted K-ary trees.

Classification criteria for regular trees

2021

Esitämme säännöllisten puiden parabolisuudelle yhtäpitäviä ehtoja. We give characterizations for the parabolicity of regular trees. peerReviewed

Effects of cluster training on body composition and strength in resistance-trained men

2020

BACKGROUND: Cluster Training (CL) is an alternative to traditional training where intra-set breaks are incorporated. Positive effects have been reported on sports performance. However, there is little research on body composition in trained subjects. OBJECTIVE: The aim of this study was to investigate the effects of three cluster training (CL) protocols comprised of different intra-set rest (RIntra) and blocks of repetitions (BK) on strength, power and body composition in individuals maintaining a high protein diet. METHODS: Twenty-nine resistance-trained male participants were randomized to RIntra 20 s and BK 3 RM (n= 8, CL1), RIntra 40 s and BK 3 RM (n= 7, CL2), RIntra 20 s and BK 6 RM (n…

Balancing and clustering of words: a combinatorial analysis of the Burrows & Wheeler Transform

2010

The Burrows-Wheeler Transform (denoted by BWT) is a well founded mathematical transformation on sequences introduced in 1994, widely used in the context of Data Compression and recently studied also from a combinatorial point of view. The transformation does not itself compress the data, but it produces a permutation bwt(w) of an input string w that is easier to compress than the original one, with some fast locally-adaptive algorithms, such as Move-to-Front in combination with Huffman or arithmetic coding. It is well-known that in most real texts, characters with the same or similar contexts tend to be the same. So, the BWT tends to group together characters which occur adjacent to similar…

Left-star order structure of Rickart *-rings

2015

Janowitz proved in 1983 that the initial segments of a Rickart *-ring with the star order are orthomodular posets. In this paper, the same result is proved for the left-star order , which was introduced by Marovtet al., by finding an orthogonality which corresponds to in a certain way and then applying a result proved by Cīrulis which states that the initial segments of any quasi-orthomodular set are orthomodular.

Daži trīssakarīgi grafi un to saimes bez Hamiltona cikliem

2013

These manuscripts (in Latvian) contain examples of graphs without Hamiltonian cycles. See the flower snark J5 on the page 13. The date here 1.6.78.

Partitionability, coverability and colorability in graphs

2014

Our research are about graph coloring with distance constraints (packing coloring) or neighborhood constraints (Grundy coloring). Let S={si| i in N*} be a non decreasing sequence of integers. An S-packing coloring is a proper coloring such that every set of color i is an si-packing (a set of vertices at pairwise distance greater than si). A graph G is (s1,... ,sk)-colorable if there exists a packing coloring of G with colors 1,... ,k. A Grundy coloring is a proper vertex coloring such that for every vertex of color i, u is adjacent to a vertex of color j, for each ji. These results allow us to determine S-packing coloring of these lattices for several sequences of integers. We examine a cla…