Zobrazeno 1 - 10
of 132
pro vyhledávání: '"Group (mathematics)"'
Publikováno v:
European Journal of Combinatorics. 80:157-171
Let T = T ( x 0 ) be the Terwilliger algebra of the Johnson scheme J ( N , D ) , where x 0 is a fixed base point. In Liang et al. (2017), an observation is made on the parameters of Leonard systems that arise from the irreducible representations of T
Autor:
Eric Swartz
Publikováno v:
European Journal of Combinatorics. 79:60-74
A generalized quadrangle is a point-line incidence geometry such that any two points lie on at most one line and, given a line $\ell$ and a point $P$ not incident with $\ell$, there is a unique point of $\ell$ collinear with $P$. We study the structu
Publikováno v:
European Journal of Combinatorics. 78:236-255
Let [ R n , k ] n , k ≥ 0 be an array of nonnegative numbers satisfying the recurrence relation R n , k = ( a 1 n + a 2 k + a 3 ) R n − 1 , k + ( b 1 n + b 2 k + b 3 ) R n − 1 , k − 1 + ( c 1 n + c 2 k + c 3 ) R n − 1 , k − 2 with R 0 , 0
Publikováno v:
European Journal of Combinatorics. 102:103481
Let $G$ be a finite, undirected $d$-regular graph and $A(G)$ its normalized adjacency matrix, with eigenvalues $1 = \lambda_1(A)\geq \dots \ge \lambda_n \ge -1$. It is a classical fact that $\lambda_n = -1$ if and only if $G$ is bipartite. Our main r
Publikováno v:
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname
We provide new examples of the asymptotic counting for the number of subsets on groups of given size which are free of certain configurations. These examples include sets without solutions to equations in non-abelian groups, and linear configurations
Autor:
Micael Toledo, Primož Potočnik
Publikováno v:
European Journal of Combinatorics. 94:103313
A graph with a semiregular group of automorphisms can be thought of as the derived cover arising from a voltage graph. Since its inception, the theory of voltage graphs and their derived covers has been a powerful tool used in the study of graphs wit
Publikováno v:
European Journal of Combinatorics
European Journal of Combinatorics, Elsevier, 2017, 62, pp.15-34. ⟨10.1016/j.ejc.2016.10.008⟩
Schilling, Anne; Thiéry, Nicolas M.; White, Graham; & Williams, Nathan. (2015). Braid moves in commutation classes of the symmetric group. UC Davis: Department of Mathematics. Retrieved from: http://www.escholarship.org/uc/item/7b029536
Schilling, A; Thiery, NM; White, G; & Williams, N. (2017). Braid moves in commutation classes of the symmetric group. EUROPEAN JOURNAL OF COMBINATORICS, 62, 15-34. doi: 10.1016/j.ejc.2016.10.008. UC Davis: Department of Mathematics. Retrieved from: http://www.escholarship.org/uc/item/6vm3n48c
European Journal of Combinatorics, Elsevier, 2017, 62, pp.15-34. ⟨10.1016/j.ejc.2016.10.008⟩
Schilling, Anne; Thiéry, Nicolas M.; White, Graham; & Williams, Nathan. (2015). Braid moves in commutation classes of the symmetric group. UC Davis: Department of Mathematics. Retrieved from: http://www.escholarship.org/uc/item/7b029536
Schilling, A; Thiery, NM; White, G; & Williams, N. (2017). Braid moves in commutation classes of the symmetric group. EUROPEAN JOURNAL OF COMBINATORICS, 62, 15-34. doi: 10.1016/j.ejc.2016.10.008. UC Davis: Department of Mathematics. Retrieved from: http://www.escholarship.org/uc/item/6vm3n48c
We prove that the expected number of braid moves in the commutation class of the reduced word $(s_1 s_2 \cdots s_{n-1})(s_1 s_2 \cdots s_{n-2}) \cdots (s_1 s_2)(s_1)$ for the long element in the symmetric group $\mathfrak{S}_n$ is one. This is a vari
Publikováno v:
European Journal of Combinatorics. 51:1-11
A map is a 2-cell embedding of a connected graph into a closed surface. A map is orientable if the supporting surface is orientable. An orientable map is regular if its group of orientation-preserving automorphisms acts transitively on the darts. Usi
Autor:
Masayoshi Yoshikawa
Publikováno v:
European Journal of Combinatorics. 51:433-442
The notion of an association scheme is a far reaching generalization of the notion of a group. During the past twenty years, many concepts and results in finite group theory have been generalized to finite scheme theory. In the present paper, we sugg
Autor:
Ulrich Dempwolff
Publikováno v:
European Journal of Combinatorics. 44:1-22
We classify the bilinear dual hyperovals over F 2 of rank n , which admit a cyclic autotopism group of order 2 n − 1 . This work is a continuation of previous research of S. Yoshiara (2008) where such dual hyperovals were investigated under the add