Some results on the Ryser design conjecture
Sign Up to like & getrecommendations! Published in 2019 at "Journal of Combinatorial Designs"
DOI: 10.1002/jcd.21699
Abstract: A Ryser design has equally many points as blocks with the provision that every two blocks intersect in a fixed number of points λ . An improper Ryser design has only one replication number and… read more here.
Keywords: let denote; ryser design; number; block ... See more keywords
Finite-dimensional irreducible □q-modules and their Drinfel'd polynomials
Sign Up to like & getrecommendations! Published in 2018 at "Linear Algebra and its Applications"
DOI: 10.1016/j.laa.2017.10.002
Abstract: Abstract Let F denote an algebraically closed field with characteristic 0, and let q denote a nonzero scalar in F that is not a root of unity. Let Z 4 denote the cyclic group of… read more here.
Keywords: finite dimensional; dimensional irreducible; let denote; irreducible modules ... See more keywords
On Finding and Enumerating Maximal and Maximum k-Partite Cliques in k-Partite Graphs
Sign Up to like & getrecommendations! Published in 2019 at "Algorithms"
DOI: 10.3390/a12010023
Abstract: Let k denote an integer greater than 2, let G denote a k-partite graph, and let S denote the set of all maximal k-partite cliques in G. Several open questions concerning the computation of S… read more here.
Keywords: enumerating maximal; partite graphs; finding enumerating; partite cliques ... See more keywords