297 search results - page 3 / 60 » Geometric and algebraic combinatorics |
COMBINATORICS
2007
13 years 8 months ago
2007
We compute the list of all minimal 2-infinite diagrams, which are cluster algebraic analogues of extended Dynkin graphs.
COMBINATORICS
2007
13 years 8 months ago
2007
In this paper, we study the simple eigenvectors of two hypomorphic matrices using linear algebra. We also give new proofs of results of Godsil and McKay.
JCT
2010
13 years 6 months ago
2010
We study a q-analog Qr(n, q) of the partition algebra Pr(n). The algebra Qr(n, q) arises as the centralizer algebra of the finite general linear group GLn(Fq) acting on a vector ...
SAC
2009
ACM
14 years 3 months ago
2009
ACM
We formalize paper fold (origami) by graph rewriting. Origami construction is abstractly described by a rewriting sys), where O is the set of abstract origami’s and ary relation...
COMBINATORICS
2006
13 years 8 months ago
2006
We expose a relationship between jamming and a generalization of Tutte's barycentric embedding. This provides a basis for the systematic treatment of jamming and maximal packi...