Sciweavers

297 search results - page 4 / 60
» Geometric and algebraic combinatorics
Sort
View
SYNASC
2008
IEEE
284views Algorithms» more  SYNASC 2008»
14 years 2 months ago
Graph Rewriting in Computational Origami
We formalize paper fold (origami) by graph rewriting. Origami tion is abstractly described by a rewrite system (O, ), where set of abstract origami’s and is a binary relation on ...
Tetsuo Ida
COMBINATORICS
1999
82views more  COMBINATORICS 1999»
13 years 8 months ago
On Highly Closed Cellular Algebras and Highly Closed Isomorphisms
We define and study m-closed cellular algebras (coherent configurations) and m-isomorphisms of cellular algebras which can be regarded as mth approximations of Schurian algebras (...
Sergei Evdokimov, Ilia N. Ponomarenko
EJC
2007
13 years 8 months ago
The origins of combinatorics on words
We investigate the historical roots of the field of combinatorics on words. They comprise applications and interpretations in algebra, geometry and combinatorial enumeration. The...
Jean Berstel, Dominique Perrin
AMC
2010
114views more  AMC 2010»
13 years 8 months ago
Witness sets of projections
Elimination is a basic algebraic operation which geometrically corresponds to projections. This article describes using the numerical algebraic geometric concept of witness sets t...
Jonathan D. Hauenstein, Andrew J. Sommese
COMBINATORICS
2007
67views more  COMBINATORICS 2007»
13 years 8 months ago
Non-Commutative Sylvester's Determinantal Identity
Sylvester’s identity is a classical determinantal identity with a straightforward linear algebra proof. We present combinatorial proofs of several non-commutative extensions, an...
Matjaz Konvalinka