Search results for "Number"
showing 10 items of 3939 documents
The overlap algebra of regular opens
2010
Abstract Overlap algebras are complete lattices enriched with an extra primitive relation, called “overlap”. The new notion of overlap relation satisfies a set of axioms intended to capture, in a positive way, the properties which hold for two elements with non-zero infimum. For each set, its powerset is an example of overlap algebra where two subsets overlap each other when their intersection is inhabited. Moreover, atomic overlap algebras are naturally isomorphic to the powerset of the set of their atoms. Overlap algebras can be seen as particular open (or overt) locales and, from a classical point of view, they essentially coincide with complete Boolean algebras. Contrary to the latter, …
Inductive Inference with Procrastination: Back to Definitions
1999
In this paper, we reconsider the definition of procrastinating learning machines. In the original definition of Freivalds and Smith [FS93], constructive ordinals are used to bound mindchanges. We investigate possibility of using arbitrary linearly ordered sets to bound mindchanges in similar way. It turns out that using certain ordered sets it is possible to define inductive inference types different from the previously known ones. We investigate properties of the new inductive inference types and compare them to other types.
On the number of Arnoux–Rauzy words
2002
Criteria for the solubility and non-simplicity of finite groups
2005
Abstract Some criteria of the non-simplicity of a finite group by graph theoretical terms are derived. This is then used to establish conditions under which a finite group is soluble.
New lower bounds for the minimum distance of generalized algebraic geometry codes
2013
Abstract In this paper, we give a new lower bound for generalized algebraic geometry codes with which we are able to construct some new linear codes having better parameters compared with the ones known in the literature. Moreover, we give a relationship between a family of generalized algebraic geometry codes and algebraic geometry codes. Finally, we propose a decoding algorithm for such a family.
On the classification of algebraic function fields of class number three
2012
AbstractLet F be an algebraic function field of one variable having a finite field Fq with q>2 elements as its field of constants. We determine all such fields for which the class number is three. More precisely, we show that, up to Fq-isomorphism, there are only 8 of such function fields. For q=2 the problem has been solved under the additional hypothesis that the function field is quadratic.
On Sturmian Graphs
2007
AbstractIn this paper we define Sturmian graphs and we prove that all of them have a certain “counting” property. We show deep connections between this counting property and two conjectures, by Moser and by Zaremba, on the continued fraction expansion of real numbers. These graphs turn out to be the underlying graphs of compact directed acyclic word graphs of central Sturmian words. In order to prove this result, we give a characterization of the maximal repeats of central Sturmian words. We show also that, in analogy with the case of Sturmian words, these graphs converge to infinite ones.
Resonance between Cantor sets
2007
Let $C_a$ be the central Cantor set obtained by removing a central interval of length $1-2a$ from the unit interval, and continuing this process inductively on each of the remaining two intervals. We prove that if $\log b/\log a$ is irrational, then \[ \dim(C_a+C_b) = \min(\dim(C_a) + \dim(C_b),1), \] where $\dim$ is Hausdorff dimension. More generally, given two self-similar sets $K,K'$ in $\RR$ and a scaling parameter $s>0$, if the dimension of the arithmetic sum $K+sK'$ is strictly smaller than $\dim(K)+\dim(K') \le 1$ (``geometric resonance''), then there exists $r<1$ such that all contraction ratios of the similitudes defining $K$ and $K'$ are powers of $r$ (``algebraic resonance…
Finite 2-groups with odd number of conjugacy classes
2016
In this paper we consider finite 2-groups with odd number of real conjugacy classes. On one hand we show that if $k$ is an odd natural number less than 24, then there are only finitely many finite 2-groups with exactly $k$ real conjugacy classes. On the other hand we construct infinitely many finite 2-groups with exactly 25 real conjugacy classes. Both resuls are proven using pro-$p$ techniques and, in particular, we use the Kneser classification of semi-simple $p$-adic algebraic groups.
Prime Rings Whose Units Satisfy a Group Identity. II
2003
Abstract Let R be a prime ring and 𝒰(R) its group of units. We prove that if 𝒰(R) satisfies a group identity and 𝒰(R) generates R,then either R is a domain or R is isomorphic to the algebra of n × n matrices over a finite field of order d. Moreover the integers n and d depend only on the group identity satisfed by 𝒰(R). This result has been recently proved by C. H. Liu and T. K. Lee (Liu,C. H.; Lee,T. K. Group identities and prime rings generated by units. Comm. Algebra (to appear)) and here we present a new different proof.