Type of research: basic Duration from: 01/01/91. to 12/31/93. Papers on project (total): 56
Institution name: Prirodoslovno-matematički fakultet, Matematički odjel, Zagreb (37) Department/Institute: Department of Mathematics University of Zagreb Address: Bijenička c. 30 10000 Zagreb , CROATIA City: 10000 - Zagreb, Croatia
Communication
Phone: 385 (0)41 432-459
Phone: 385 (0)41 432-484
Fax: 385 (0)41 432-484
E-mail: dveljan@math.hr
Summary: Work on this project has emphasis on enumerative
combinatorics and algebraic graph theory, such as combinatorics of walks on
graphs, problems of formal languages concerning monomer/dimer problem,
Kekule structures (perfect matchings), computing topological indeces of
graphs, discrete mathematics in chemistry and chemical graphs, f-vectors of
complexes, combinatorial, analytical and geometric inequalities, symmetric
functions and characteristic classes, parallel algorithms and path
problems, various combinatorial and other algorithms and their analysis,
holographic neural networks.
Keywords: Enumerative combinatorics and algebraic graph theory, Walks on graphs, Formal languages and monomer/dimer problem, Kekule structures (perfect matchings), Topological index of a graph, Discrete mathematics in chemistry and chemical graphs, f-vectors of complexes, Geometric, combinatorial and analytical inequalities, Symetric functions and characteristic classes, Paallel algorithms and path problems, Analysis of algorithms, Holographic neural networks
Research goals: The basic goal of the proposed research project is
insystemazing, extending and applying the exsisting particularresults of
our own researchers as well as other's. From variousfields (mathematics,
chemistry, computer science etc.), having inmind primarily the development
of new mathematical techniques. Itis expected to get new results in areas
such as: Algebraic graphtheory, enumerative and polyhedral combinatorics,
parallelcomputing, combinatorial algorithmics and
optimizations,nonbalanced designes, chemical graph theory and
applications. In particular, some concrete contributions are expected
indescription of regular languages for monomer/dimer problem (k>3),on
f-vectors of some simplicial complexes, on variouscombinatorial,
analytical and geometric inequalities, on colorings of somegraphs, on
algorithms for some models of paralel computings andmore effective
algorithms for some special path-problems andtheir implementations on
transputers. Further, it is expected toobtain some results on enumerations
of some combinatorial objectsimportant in chemistry such as monomer/dimer
coverings and Kekulestructures for higher-dimensional systems as well as
computationsof topological indices of some chemical graphs. New
efficientalgorithms with their complexities in combinatorial
optimizationsand otherwise are also expected. Promissing are also
newdevelopments on artificial neural networks. In order to improve the
general problem of education, somemembers of the project will work on
university textbooks andalike and for the sake of popularization of math
and sciencevarious specialized articles.
COOPERATION - INSTITUTIONS
Name of institution
: Eotvos Lorand Universitet Type of institution: Economical/Production City: Budimpeta, Mađarska
Name of institution
: Kijevski dravni univerzitet Type of institution: Economical/Production City: Kijev, Ukrajina
Name of institution
: Universitat Graz Type of institution: Economical/Production City: Graz, Austrija
Name of institution
: Florida State University Type of institution: Economical/Production City: Tallahassee, Florida, USA
Name of institution
: Universitat Muenchen Type of institution: Economical/Production City: Muenchen, Germany
Name of institution
: Universite Bordeaux I - LaBRI Type of institution: University/Faculty Type of cooperation: Other City: Bordeaux, France Other information about the project.