Search results for "Number"
showing 10 items of 3939 documents
On nilpotent Moufang loops with central associators
2007
Abstract In this paper, we investigate Moufang p-loops of nilpotency class at least three for p > 3 . The smallest examples have order p 5 and satisfy the following properties: (1) They are of maximal nilpotency class, (2) their associators lie in the center, and (3) they can be constructed using a general form of the semidirect product of a cyclic group and a group of maximal class. We present some results concerning loops with these properties. As an application, we classify proper Moufang loops of order p 5 , p > 3 , and collect information on their multiplication groups.
The Action of the Symplectic Group Associated with a Quadratic Extension of Fields
1999
Abstract Given a quadratic extension L/K of fields and a regular alternating space (V, f) of finite dimension over L, we classify K-subspaces of V which do not split into the orthogonal sum of two proper K-subspaces. This allows one to determine the orbits of the group SpL(V, f) in the set of K-subspaces of V.
Construction of chaotic dynamical system
2010
The first‐order difference equation xn+ 1 = f(xn ), n = 0,1,…, where f: R → R, is referred as an one‐dimensional discrete dynamical system. If function f is a chaotic mapping, then we talk about chaotic dynamical system. Models with chaotic mappings are not predictable in long‐term. In this paper we consider family of chaotic mappings in symbol space S 2. We use the idea of topological semi‐conjugacy and so we can construct a family of mappings in the unit segment such that it is chaotic. First published online: 09 Jun 2011
Burrows-Wheeler transform and Run-Length Enconding
2017
In this paper we study the clustering effect of the Burrows-Wheeler Transform (BWT) from a combinatorial viewpoint. In particular, given a word w we define the BWT-clustering ratio of w as the ratio between the number of clusters produced by BWT and the number of the clusters of w. The number of clusters of a word is measured by its Run-Length Encoding. We show that the BWT-clustering ratio ranges in ]0, 2]. Moreover, given a rational number \(r\,\in \,]0,2]\), it is possible to find infinitely many words having BWT-clustering ratio equal to r. Finally, we show how the words can be classified according to their BWT-clustering ratio. The behavior of such a parameter is studied for very well-…
Learning with confidence
1996
Herein we investigate learning in the limit where confidence in the current conjecture accrues with time. Confidence levels are given by rational numbers between 0 and 1. The traditional requirement that for learning in the limit is that a device must converge (in the limit) to a correct answer. We further demand that the associated confidence in the answer (monotonically) approach 1 in the limit. In addition to being a more realistic model of learning, our new notion turns out to be a more powerful as well. In addition, we give precise characterizations of the classes of functions that are learnable in our new model(s).
Restriction of odd degree characters and natural correspondences
2016
Let $q$ be an odd prime power, $n > 1$, and let $P$ denote a maximal parabolic subgroup of $GL_n(q)$ with Levi subgroup $GL_{n-1}(q) \times GL_1(q)$. We restrict the odd-degree irreducible characters of $GL_n(q)$ to $P$ to discover a natural correspondence of characters, both for $GL_n(q)$ and $SL_n(q)$. A similar result is established for certain finite groups with self-normalizing Sylow $p$-subgroups. We also construct a canonical bijection between the odd-degree irreducible characters of $S_n$ and those of $M$, where $M$ is any maximal subgroup of $S_n$ of odd index; as well as between the odd-degree irreducible characters of $G = GL_n(q)$ or $GU_n(q)$ with $q$ odd and those of $N_{G}…
A Note on Algebraic Sums of Subsets of the Real Line
2002
AbstractWe investigate the algebraic sums of sets for a large class of invari-ant ˙-ideals and ˙- elds of subsets of the real line. We give a simpleexample of two Borel subsets of the real line such that its algebraicsum is not a Borel set. Next we show a similar result to Proposition 2from A. Kharazishvili paper [4]. Our results are obtained for ideals withcoanalytical bases. 1 Introduction We shall work in ZFC set theory. By !we denote natural numbers. By 4wedenote the symmetric di erence of sets. The cardinality of a set Xwe denoteby jXj. By R we denote the real line and by Q we denote rational numbers. IfAand Bare subsets of R n and b2R , then A+B= fa+b: a2A^b2Bgand A+ b= A+ fbg. Simila…
The maximal coefficient of ternary cyclotomic polynomials with one free prime
2014
A cyclotomic polynomial Φn(x) is said to be ternary if n = pqr, with p, q and r distinct odd primes. Let M(p, q) be the maximum (in absolute value) coefficient appearing in the polynomial family Φpqr(x) with p < q < r, p and q fixed. Here a stronger version of the main conjecture of Gallot, Moree and Wilms regarding M(p, q) is established. Furthermore it is shown that there is an algorithm to compute M(p): = max {M(p, q): q > p}. Our methods are the most geometric used so far in the study of ternary cyclotomic polynomials.
Radical Rings with Engel Conditions
2000
Abstract An associative ring R without unity 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, for a radical ring R , the group R ∘ satisfies an n -Engel condition for some positive integer n if and only if R is m -Engel as a Lie ring for some positive integer m depending only on n .
Circular sturmian words and Hopcroft’s algorithm
2009
AbstractIn order to analyze some extremal cases of Hopcroft’s algorithm, we investigate the relationships between the combinatorial properties of a circular sturmian word (x) and the run of the algorithm on the cyclic automaton Ax associated to (x). The combinatorial properties of words taken into account make use of sturmian morphisms and give rise to the notion of reduction tree of a circular sturmian word. We prove that the shape of this tree uniquely characterizes the word itself. The properties of the run of Hopcroft’s algorithm are expressed in terms of the derivation tree of the automaton, which is a tree that represents the refinement process that, in the execution of Hopcroft’s alg…