Several identities for the characteristic polynomial of a combinatorial geometry
نویسندگان
چکیده
منابع مشابه
Combinatorial Geometry in Characteristic 1
Many geometries over fields have formal analogues which can be thought of as geometries over the field of 1 element1. For example, the projective plane over the field Fq has q2 + q+ 1 points and the same number of lines; every line in the plane has q + 1 points. When q = 1, we have a plane with three points and three lines, i.e. a triangle. The flag complex of the triangle is a thin building of...
متن کاملPolynomial Methods in Combinatorial Geometry
iii 1 The Erdős Distance Problem 1 2 Incidence Geometry 5 2.1 The distinct distances incidence problem . . . . . . . . . . . . . . . . . 5 2.2 The geometry of Elekes’ incidence problem . . . . . . . . . . . . . . . . 11 2.3 Ruled Surfaces . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 3 Dvir’s Polynomial Method 17 3.1 The Polynomial Method . . . . . . . . . . . . . . . . . . ....
متن کاملinvestigating the feasibility of a proposed model for geometric design of deployable arch structures
deployable scissor type structures are composed of the so-called scissor-like elements (sles), which are connected to each other at an intermediate point through a pivotal connection and allow them to be folded into a compact bundle for storage or transport. several sles are connected to each other in order to form units with regular polygonal plan views. the sides and radii of the polygons are...
Polynomial identities for partitions
For any partition λ of an integer n , we write λ =< 11, 22, . . . , nn > where mi(λ) is the number of parts equal to i . We denote by r(λ) the number of parts of λ (i.e. r(λ) = ∑n i=1mi(λ) ). Recall that the notation λ ` n means that λ is a partition of n . For 1 ≤ k ≤ N , let ek be the k-th elementary symmetric function in the variables x1, . . . , xN , let hk be the sum of all monomials of to...
متن کاملPolynomial Identities for Hypermatrices
We develop an algorithm to construct algebraic invariants for hypermatrices. We then construct hyperdeterminants and exhibit a generalization of the Cayley–Hamilton theorem for hypermatrices.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1980
ISSN: 0012-365X
DOI: 10.1016/0012-365x(80)90032-1