AbstractA study is made of asymptotic arithmetical properties of the isomorphism classes of certain types of finite graphs, and of certain polynomials over Galois fields
Given that a large graph admits a group of automorphisms isomorphic to the abstract group G, what is...
AbstractCriteria are given for polynomials of the type Xn + aX3 + bX2 + cX + d, to have Galois group...
The problem of identifying a functor between the categories of algebras and graphs is currently open...
AbstractA study is made of asymptotic arithmetical properties of the isomorphism classes of certain ...
AbstractWith emphasis on some natural asymptotic enumeration questions, a study is made of various a...
In this thesis, we investigate various topics regarding the arithmetic of polynomials over finite fi...
AbstractAlthough many results concerning permutations and permutation groups are known, less attenti...
summary:Research on combinatorial properties of sequences in groups and semigroups originates from B...
In this report, we revised some important definitions with examples and results of ring theory such ...
summary:Research on combinatorial properties of sequences in groups and semigroups originates from B...
AbstractThe value Px(q) at an integer q ⩾1 of the chromatic polynomial of a finite graph X is the nu...
We study the first-order almost-sure theories for classes of finite structures that are specified by...
AbstractLet G b e a finite graph. A polynomial P(G, x) associated with G is defined, and a formula f...
AbstractLet F be a field and let G be a finite graph with a total ordering on its edge set. Richard ...
AbstractGeneralizing the norm and trace mappings for Fqr/Fq, we introduce an interesting class of po...
Given that a large graph admits a group of automorphisms isomorphic to the abstract group G, what is...
AbstractCriteria are given for polynomials of the type Xn + aX3 + bX2 + cX + d, to have Galois group...
The problem of identifying a functor between the categories of algebras and graphs is currently open...
AbstractA study is made of asymptotic arithmetical properties of the isomorphism classes of certain ...
AbstractWith emphasis on some natural asymptotic enumeration questions, a study is made of various a...
In this thesis, we investigate various topics regarding the arithmetic of polynomials over finite fi...
AbstractAlthough many results concerning permutations and permutation groups are known, less attenti...
summary:Research on combinatorial properties of sequences in groups and semigroups originates from B...
In this report, we revised some important definitions with examples and results of ring theory such ...
summary:Research on combinatorial properties of sequences in groups and semigroups originates from B...
AbstractThe value Px(q) at an integer q ⩾1 of the chromatic polynomial of a finite graph X is the nu...
We study the first-order almost-sure theories for classes of finite structures that are specified by...
AbstractLet G b e a finite graph. A polynomial P(G, x) associated with G is defined, and a formula f...
AbstractLet F be a field and let G be a finite graph with a total ordering on its edge set. Richard ...
AbstractGeneralizing the norm and trace mappings for Fqr/Fq, we introduce an interesting class of po...
Given that a large graph admits a group of automorphisms isomorphic to the abstract group G, what is...
AbstractCriteria are given for polynomials of the type Xn + aX3 + bX2 + cX + d, to have Galois group...
The problem of identifying a functor between the categories of algebras and graphs is currently open...
DOI
Add to ORKG