✦ LIBER ✦

A combinatorial identity arising from symplectic geometry

✍ Scribed by Hao Ding

Publisher: Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 2009
Tongue: English
Weight: 227 KB
Volume: 25
Category: Article
ISSN: 1439-7617
DOI: 10.1007/s10114-009-8087-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the geometry of symplectic pencils ar

On the geometry of symplectic pencils arising from discrete-time matrix equations

✍ Nevio Carpanese 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 101 KB

In this paper general symplectic matrix pencils are considered disregarding the particular matrix equations from which they arise. A parameterization of the Lagrangian de ating subspaces is given with the only assumption of regularity of the matrix pencil.

Several identities for the characteristi

Several identities for the characteristic polynomial of a combinatorial geometry

✍ Tom Brylawski; James Oxley 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 992 KB

In this paper we explore a research problem of Greene: to find inequalities for the Miibius function which become equalities in the presence of modularity. We replace these inequalities with identities and give combinatorial interpretations for the difference.

A combinatorial optimization problem ari

A combinatorial optimization problem arising from text classification

✍ Sandro Bosio; Giovanni Righini 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 74 KB

We study a combinatorial optimization problem related to the automatic classification of texts. The problem consists of covering a given text using strings from a given set, where a cost is incurred for each type of string used. We give a 0-1 linear programming formulation and we report on computati

On a functional equation arising from hy

On a functional equation arising from hyperbolic geometry

✍ Walter Benz 📂 Article 📅 1981 🏛 Springer 🌐 English ⚖ 41 KB

On a functional equation arising from hy

On a functional equation arising from hyperbolic geometry

✍ Walter Benz 📂 Article 📅 1980 🏛 Springer 🌐 English ⚖ 213 KB

A Dynkin diagram classification theorem

A Dynkin diagram classification theorem arising from a combinatorial problem

✍ Robert A. Proctor 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 646 KB

## Los .4ngrlrs. Caljf'orrlia 90024 A combinatorial-linear algebraic condition suflicient for a ranked partially ordered set to be rank unimodal and strongly Sperner is presented. The distributive lattices which satisfy this condition are classified. These lattices are indexed by Dynkin diagrams