Kneser and Hereditarily Kneser Subgroups of a Profinite Group

2000 Mathematics Subject Classification: 20E18, 12G05, 12F10, 12F99.

Henselian Discrete Valued Fields Admitting One-Dimensional Local Class Field Theory

2000 Mathematics Subject Classification: 11S31 12E15 12F10 12J20.

Bulgarian Digital Mathematical Library BulDML and Czech Digital Mathematical Library DML-CZ as parts of the European Digital Mathematics Library EuDML

The paper presents in brief the Bulgarian Digital Mathematical Library BulDML and the Czech Digital Mathematical Library DML-CZ. Both libraries use the open source software DSpace and both are partners in the European Digital Mathematics Library EuDML. We describe their content and metadata schemas; outline the architecture system and overview the statistics of its use.

Probabilistic Models in Cryptography, Coding Theory and Tests for PRNG

2000 Mathematics Subject Classification: 94A29, 94B70

Discrete Time Bisexual Branching Processes in Varying Environments

2000 Mathematics Subject Classification: 60J80

Classification of Chenopodium Genus Populations and Species Based on Continuous and Categorical Variables

2000 Mathematics Subject Classification: 62P10, 62H30

A Computational Approach for the Statistical Estimation of Discrete Time Branching Processes with Immigration

2010 Mathematics Subject Classification: 60J80.

Lp extremal polynomials. Results and perspectives

2000 Mathematics Subject Classification: 30C40, 30D50, 30E10, 30E15, 42C05.

Selections, Paracompactness and Compactness

2000 Mathematics Subject Classification: 54C60, 54C65, 54D20, 54D30.

An eMathTeacher Tool for Active Learning Fleury’s Algorithm

An eMathTeacher [Sánchez-Torrubia 2007a] is an eLearning on line self assessment tool that help students to active learning math algorithms by themselves, correcting their mistakes and providing them with clues to find the right solution. The tool presented in this paper is an example of this new concept on Computer Aided Instruction (CAI) resources and has been implemented as a Java applet and designed as an auxiliary instrument for both classroom teaching and individual practicing of Fleury’s algorithm. This tool, included within a set of eMathTeacher tools, has been designed as educational complement of Graph Algorithm active learning for first course students. Its characteristics of visualization, simplicity and interactivity, make this tutorial a great value pedagogical instrument.

What is Q-extension?

In this paper we present a developed software in the area of Coding Theory. Using it, codes with given properties can be classified. A part of this software can be used also for investigations (isomorphisms, automorphism groups) of other discrete structures-combinatorial designs, Hadamard matrices, bipartite graphs etc.

On Graph-Based Cryptography and Symbolic Computations

We have been investigating the cryptographical properties of in nite families of simple graphs of large girth with the special colouring of vertices during the last 10 years. Such families can be used for the development of cryptographical algorithms (on symmetric or public key modes) and turbocodes in error correction theory. Only few families of simple graphs of large unbounded girth and arbitrarily large degree are known. The paper is devoted to the more general theory of directed graphs of large girth and their cryptographical applications. It contains new explicit algebraic constructions of in finite families of such graphs. We show that they can be used for the implementation of secure and very fast symmetric encryption algorithms. The symbolic computations technique allow us to create a public key mode for the encryption scheme based on algebraic graphs.

On the Error-Correcting Performance of some Binary and Ternary Linear Codes

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.

A Prototype of an Extension to the UDDI Registry Allowing Pubilcation and Search Based on Subjective Evaluations

The paper has been presented at the International Conference Pioneers of Bulgarian Mathematics, Dedicated to Nikola Obreshko and Lubomir Tschakalo , So a, July, 2006.

Algorithms for Finding Unitals and Maximal Arcs in Projective Planes of Order 16

The paper has been presented at the International Conference Pioneers of Bulgarian Mathematics, Dedicated to Nikola Obreshkoff and Lubomir Tschakalo ff , Sofia, July, 2006.