Search results for " Mathematics"

On monadic quantale algebras: basic properties and representation theorems

2010

Motivated by the concept of quantifier (in the sense of P. Halmos) on different algebraic structures (Boolean algebras, Heyting algebras, MV-algebras, orthomodular lattices, bounded distributive lattices) and the resulting notion of monadic algebra, the paper introduces the concept of a monadic quantale algebra, considers its properties and provides several representation theorems for the new structures.

Free sequences and the tightness of pseudoradial spaces

2019

Let F(X) be the supremum of cardinalities of free sequences in X. We prove that the radial character of every Lindelof Hausdorff almost radial space X and the set-tightness of every Lindelof Hausdorff space are always bounded above by F(X). We then improve a result of Dow, Juhasz, Soukup, Szentmiklossy and Weiss by proving that if X is a Lindelof Hausdorff space, and $$X_\delta $$ denotes the $$G_\delta $$ topology on X then $$t(X_\delta ) \le 2^{t(X)}$$ . Finally, we exploit this to prove that if X is a Lindelof Hausdorff pseudoradial space then $$F(X_\delta ) \le 2^{F(X)}$$ .

Symmetric and asymmetric cryptographic key exchange protocols in the octonion algebra

2019

AbstractWe propose three cryptographic key exchange protocols in the octonion algebra. Using the totient function, defined for integral octonions, we generalize the RSA public-key cryptosystem to the octonion arithmetics. The two proposed symmetric cryptographic key exchange protocols are based on the automorphism and the derivation of the octonion algebra.

Post‐processing of Gauss–Seidel iterations

1999

A Note on Perturbations of Stochastic Matrices

2000

Characters, bilinear forms and solvable groups

2016

Abstract We prove a number of results about the ordinary and Brauer characters of finite solvable groups in characteristic 2, by defining and using the concept of the extended nucleus of a real irreducible character. In particular we show that the Isaacs canonical lift of a real irreducible Brauer character has Frobenius–Schur indicator +1. We also show that the principal indecomposable module corresponding to a real irreducible Brauer character affords a quadratic geometry if and only if each extended nucleus is a split extension of a nucleus.

Cardinal estimates involving the weak Lindelöf game

2021

AbstractWe show that if X is a first-countable Urysohn space where player II has a winning strategy in the game $$G^{\omega _1}_1({\mathcal {O}}, {\mathcal {O}}_D)$$ G 1 ω 1 ( O , O D ) (the weak Lindelöf game of length $$\omega _1$$ ω 1 ) then X has cardinality at most continuum. This may be considered a partial answer to an old question of Bell, Ginsburg and Woods. It is also the best result of this kind since there are Hausdorff first-countable spaces of arbitrarily large cardinality where player II has a winning strategy even in the weak Lindelöf game of countable length. We also tackle the problem of finding a bound on the cardinality of a first-countable space where player II has a wi…

Finitary shadows of compact subgroups of $$S(\omega )$$

2020

AbstractLet LF be the lattice of all subgroups of the group $$SF(\omega )$$SF(ω) of all finitary permutations of the set of natural numbers. We consider subgroups of $$SF(\omega )$$SF(ω) of the form $$C\cap SF(\omega )$$C∩SF(ω), where C is a compact subgroup of the group of all permutations. In particular, we study their distribution among elements of LF. We measure this using natural relations of orthogonality and almost containedness. We also study complexity of the corresponding families of compact subgroups of $$S(\omega )$$S(ω).

Arithmetical Analysis of Biomolecular Finite Automaton

2013

In the paper we present a theoretical analysis of extension of the finite automaton built on DNA (introduced by the Shapiro team) to an arbitrary number of states and symbols. In the implementation we use a new idea of several restriction enzymes instead of one. We give arithmetical conditions for the existence of such extensions in terms of ingredients used in the implementation.

On a paper of Beltrán and Shao about coprime action

2020

Abstract Assume that A and G are finite groups of coprime orders such that A acts on G via automorphisms. Let p be a prime. The following coprime action version of a well-known theorem of Ito about the structure of a minimal non-p-nilpotent groups is proved: if every maximal A-invariant subgroup of G is p-nilpotent, then G is p-soluble. If, moreover, G is not p-nilpotent, then G must be soluble. Some earlier results about coprime action are consequences of this theorem.