Graphs and Combinatorics
Издатель: Springer Nature · 20 статей
-
Abstract Algorithmic Classes
We consider several approaches to defining an abstract algorithmic class formulated in the language of operators. We give conditions under which standard algorithmic classes have the introduced properties. Several examples of algebraic...
-
Arithmetic Invariants for Finite Simple and Related Groups
In this short note, we address problems concerning the characterization of simple and related groups by various arithmetic invariants. We propose a uniform approach to such questions and discuss both known results and open problems in this area.
-
Chiral Algebras with Abelian Conformal Part
We study a categorical approach to the concept of varieties of chiral algebras. We prove that the class of chiral algebras in the variety defined by a binary quadratic operad Var, whose conformal structure is abelian, coincides with the...
-
On Unions of Chains of Jónsson Algebras
Some conditions are given under which the union of an increasing chain of Jónsson algebras is again a Jónsson algebra. Conditions are found under which there exists a countable increasing chain of Jónsson groups whose union is not a...
-
Index Sets of Decidably Categorical Models with Unary Functional Symbols
We obtain a criterion for decidable categoricity of injective unars. Exact complexity estimates are established for the index sets of the classes of strongly constructivizable injective unars and decidably categorical injective unars....
-
Element Orders in the Graph Automorphism Extensions of Finite Linear and Unitary Groups in Characteristic Two
We study element orders in the graph automorphism extensions of finite linear and unitary groups in characteristic two.
-
Complexity of the Problem of ∀-Representability for Sentences in Signatures with Unary Symbols
We study the complexity of the existence problem of a ∀-sentence (∃-sentence) equivalent to a given sentence in signatures containing only unary symbols. We prove that if the signature consists of an at most one function symbol and an...
-
On Intersections of π -Hall Subgroups in a D π -Group with Sporadic and Alternating Composition Factors
We consider intersections of π -Hall subgroups in a finite D π -group all of whose composition factors are sporadic or alternating groups. The main result of the paper in the case under consideration confirms Conjecture 18.31 from the...
-
Model Theory of Enriched Boolean Algebras
We study enriched Boolean algebras. We describe subalgebras of Boolean algebras determined by fixed elements of automorphisms. We construct a continuum of superatomic Boolean algebras with a distinguished subalgebra whose elementary...
-
On Unbounded Groups of Permutations of Natural Numbers
Let G be the group of all bounded permutations of the set of natural numbers $${\mathbb{N}}$$. Suppose that a group H contains elements h , h 1 , . . . , h n , . . . such that | h | = ∞, $${h}_{1}^{p}$$ = h , $${h}_{2}^{p}$$ = h 1 , . ....
-
Index Sets of Decidably Categorical Models that are Elementarily Equivalent to the Powers of Omega
A strongly constructivizable model S is decidably categorical if for any decidable copies A and B of S, there exists a computable isomorphism from A onto B. The paper investigates the complexity of families of decidably categorical...
-
The Groups G 2 (2 m ) and 3 D 4 (2 3 m ) as Automorphism Groups of Regular Polytopes of Rank 3, 4, and 5
We prove that G 2 (2 m ) and 3 D 4 (2 3 m ) are automorphism groups of regular polytopes of rank n = 4, 5, except for the group 3 D 4 (2 3 m ) when n = 5 and m is a power of 3. The minimal number of generating conjugate involutions...
-
A Topological Characterization of ITBM–Representable Relational Structures
We describe relational structures of finite signature representable by means of infinite time Blum–Shub–Smale machines in terms of Borel hierarchy on Baire and Cantor Polish spaces.
-
Friedberg Numberings on Admissible Sets
We consider the problem of existence of single-valued, computable, positive, and negative representations of the family of all computably enumerable subsets on admissible structures. Additionally, a description of the properties of the...
-
Independence of Quandle Axioms
We investigate the independence of axioms defining a quandle – an algebraic structure important in knot theory and combinatorial algebra. It is proved that all four axioms included in the standard definition of a quandle are...
-
Continuity in Computable Analysis and Σ-Definability
The note concerns the comparative study of two approaches to generalized computability over the real numbers: computable analysis and Σ-definability in hereditarily finite su-perstructures. As known, there exist total computable...
-
Towards the Sharp Baer–suzuki Theorem for the π -radical: Symplectic Groups
We study the following conjecture, which is a sharp analogue of the well-known Baer–Suzuki theorem for the π-radical of a finite group. For an arbitrary set π of primes not containing all primes, let r be the smallest prime not in π....
-
The Quasivariety Generated by a Free Nilpotent Group
We prove that the quasivariety qF (𝒩 c ) generated by the free non-abelian c-step nilpotent group ( c ≥ 4) contains a continuum of quasivarieties. All quasivarieties contained in qF (𝒩 3 ) are described.
-
On Two Ways of Representation of Uncountable Structures
An embedding of the hereditarily finite superstructure over the ordered field of real numbers into the set of reals is constructed which takes Σ-subsets to sets computable by infinite time Blum-Shub-Smale machines (ITBMs). A notion of...
-
Conditions for Existence of Jonsson Hybrids
We investigate the existence of hybrids of Jonsson theories in various first-order languages. A general framework for hybrids is constructed, defined by ∀∃-sentences true in the Cartesian product of semantic models. For theories in the...