New Vacuum Solutions for Quadratic Metric-Affine Gravity - a Metric Affine Model for the Massless Neutrino?

AMS Subj. Classification: 83C15, 83C35

Inequalities and Asymptotic Formulae for the Three Parametric Mittag-Leffler Functions

MSC 2010: 33E12, 30A10, 30D15, 30E15

On Sandwich Theorem of Analytic Functions Involving Integral Operator

2000 Mathematics Subject Classification: 30C45

Exploring Linear Functions – Representational Relationship

Experiences from a German-Ukrainian project for the joint development of dynamic learning environments are reported. General methodological and technological aspects are discussed as well as special items arising from the cross-cultural collaboration.

Existence and Asymptotic Stability of Solutions of a Perturbed Quadratic Fractional Integral Equation

Mathematics Subject Classification: 45G10, 45M99, 47H09

About Learning Discrete Mathematics at Bulgarian School

The present work is dedicated to the learning discrete mathematics at Bulgarian school. A review of syllabuses and standards has been made. A project of learning discrete mathematics elements from first to twelve class is proposed.

Transforming Mathematics Learning for Students and Teachers with Digital Technologies

Силия Хойлс, Ричардс Нос - Това представяне е вдъхновено от делото на Сиймър Пепърт и много други от целия свят (включително Джим Капут и наши колеги от България), които са работили и работят в духа на конструкционизма и с които сме имали щастието да си сътрудничим в областта на математическото образование и дигиталните технологии в течение на десетилетия.

Hyperbolic Fourth-R Quadratic Equation and Holomorphic Fourth-R Polynomials

MSC 2010: 30C10, 32A30, 30G35

Automatized Generation of Personalized Learning Paths through Aspects in Multidimensional Spaces

Report published in the Proceedings of the National Conference on "Education and Research in the Information Society", Plovdiv, May, 2016

E-Support for English Language Course to Enhance University Students’ Learning.

The peculiarities of English language teaching for students at higher educational establishment using some elements of distance learning, developed by the author, are described in this article. The results of students’ questioning, received at the end of the experimental teaching, are suggested and analyzed. The conclusions are formulated and the further ways of teaching English with e-support are outlined.

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.

Generalized Nets Model of an E-Learning System Software Architecture

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

Algebraic Computations with Hausdorff Continuous Functions

The paper has been presented at the 12th International Conference on Applications of Computer Algebra, Varna, Bulgaria, June, 2006.

FLQ, the Fastest Quadratic Complexity Bound on the Values of Positive Roots of Polynomials

In this paper we present F LQ, a quadratic complexity bound on the values of the positive roots of polynomials. This bound is an extension of FirstLambda, the corresponding linear complexity bound and, consequently, it is derived from Theorem 3 below. We have implemented FLQ in the Vincent-Akritas-Strzeboński Continued Fractions method (VAS-CF) for the isolation of real roots of polynomials and compared its behavior with that of the theoretically proven best bound, LM Q. Experimental results indicate that whereas F LQ runs on average faster (or quite faster) than LM Q, nonetheless the quality of the bounds computed by both is about the same; moreover, it was revealed that when VAS-CF is run on our benchmark polynomials using F LQ, LM Q and min(F LQ, LM Q) all three versions run equally well and, hence, it is inconclusive which one should be used in the VAS-CF method.

Essential Arity Gap of Boolean Functions

In this paper we investigate the Boolean functions with maximum essential arity gap. Additionally we propose a simpler proof of an important theorem proved by M. Couceiro and E. Lehtonen in [3]. They use Zhegalkin’s polynomials as normal forms for Boolean functions and describe the functions with essential arity gap equals 2. We use to instead Full Conjunctive Normal Forms of these polynomials which allows us to simplify the proofs and to obtain several combinatorial results concerning the Boolean functions with a given arity gap. The Full Conjunctive Normal Forms are also sum of conjunctions, in which all variables occur.