30 resultados para Hilbert schemes of points Poincaré polynomial Betti numbers Goettsche formula

em Bulgarian Digital Mathematics Library at IMI-BAS


Relevância:

100.00% 100.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: 13P05, 14M15, 14M17, 14L30.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

This work was presented in part at the 8th International Conference on Finite Fields and Applications Fq^8 , Melbourne, Australia, 9-13 July, 2007.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

The subject of collinearity of 3 points on a line is challenging for 7th- grade students. This article discusses the possibilities to demonstrate different approaches for solving collinearity of three points on a line: straight angle, axiom on the uniform mapping of an angle on a half-plane, parallel axiom, vector method, and homothetic features. The experiment was held using GEONExT to demonstrate by visual methods collinearity of three points on a line a district type of problems.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: 12D10.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: 42A45.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: 60H30, 35K55, 35K57, 35B35.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

In this paper we survey work on and around the following conjecture, which was first stated about 45 years ago: If all the zeros of an algebraic polynomial p (of degree n ≥ 2) lie in a disk with radius r, then, for each zero z1 of p, the disk with center z1 and radius r contains at least one zero of the derivative p′ . Until now, this conjecture has been proved for n ≤ 8 only. We also put the conjecture in a more general framework involving higher order derivatives and sets defined by the zeros of the polynomials.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: 12D10.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

In this work, we determine the coset weight spectra of all binary cyclic codes of lengths up to 33, ternary cyclic and negacyclic codes of lengths up to 20 and of some binary linear codes of lengths up to 33 which are distance-optimal, by using some of the algebraic properties of the codes and a computer assisted search. Having these weight spectra the monotony of the function of the undetected error probability after t-error correction P(t)ue (C,p) could be checked with any precision for a linear time. We have used a programm written in Maple to check the monotony of P(t)ue (C,p) for the investigated codes for a finite set of points of p € [0, p/(q-1)] and in this way to determine which of them are not proper.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Pólya’s fundamental enumeration theorem and some results from Williamson’s generalized setup of it are proved in terms of Schur- Macdonald’s theory (S-MT) of “invariant matrices”. Given a permutation group W ≤ Sd and a one-dimensional character χ of W , the polynomial functor Fχ corresponding via S-MT to the induced monomial representation Uχ = ind|Sdv/W (χ) of Sd , is studied. It turns out that the characteristic ch(Fχ ) is the weighted inventory of some set J(χ) of W -orbits in the integer-valued hypercube [0, ∞)d . The elements of J(χ) can be distinguished among all W -orbits by a maximum property. The identity ch(Fχ ) = ch(Uχ ) of both characteristics is a consequence of S-MT, and is equivalent to a result of Williamson. Pólya’s theorem can be obtained from the above identity by the specialization χ = 1W , where 1W is the unit character of W.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

* Partially supported by Universita` di Bari: progetto “Strutture algebriche, geometriche e descrizione degli invarianti ad esse associate”.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

It is shown that the invertible polynomial maps over a finite field Fq , if looked at as bijections Fn,q −→ Fn,q , give all possible bijections in the case q = 2, or q = p^r where p > 2. In the case q = 2^r where r > 1 it is shown that the tame subgroup of the invertible polynomial maps gives only the even bijections, i.e. only half the bijections. As a consequence it is shown that a set S ⊂ Fn,q can be a zero set of a coordinate if and only if #S = q^(n−1).

Relevância:

100.00% 100.00%

Publicador:

Resumo:

∗ Research partially supported by INTAS grant 97-1644

Relevância:

100.00% 100.00%

Publicador:

Resumo:

* This paper was made according to the program № 14 of fundamental scientific research of the Presidium of the Russian Academy of Sciences, the project 06-I-П14-052

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Based on a geometry problem by Ivan Salabashev we demonstrate an exploratory process leading to conic sections as a locus of points. We work for the purpose with the GeoGebra dynamic software making use of different objects’ representations for explorations related with conic sections.