Repozitoriul Instituțional al Universității de Stat din Moldova (RI USM)

Institutional Repository of Moldova State University (IR MSU)

Repozitoriul Instituțional al Universității de Stat din Moldova reprezintă arhiva digitală cu acces deschis a rezultatelor cercetărilor științifice și științifico-didactice efectuate în cadrul universității. Conținutul arhivei este multidisciplinar și include lucrări din domeniile științelor exacte și socio-umanistice.
The Institutional Repository of the State University of Moldova is an open access digital archive of the results of scientific and scientific-didactic research carried out within the university. The archive's content is multidisciplinary and includes works from the fields of exact sciences, social sciences and humanities.

Communities in DSpace

Select a community to browse its collections.

Now showing 1 - 5 of 17

Recent Submissions

Impactul remediului BioR asupra unor parametri ai sistemului prooxidant (oxidant)-antioxidant la prepeliţele adulte [Articol]
(Universitatea de Stat din Moldova, 2015) Macari, Ana; Gudumac, Valentin; Macari, Vasile; Putin, Victor; Pavlicenco, Natalia; Manoli, Olga
Problema stimulării productivităţii în avicultură, pentru asigurarea consumatorilor cu alimente de înaltă calitate, devine din ce în ce mai stringentă la nivel mondial. Studiul a avut drept scop evaluarea efectelor remediului BioR asupra indicilor marker ai peroxidării lipidelor (PLO) şi ai sistemului antioxidant (SAO) la prepeliţele adulte crescute în condiţii fiziologice de producţie. Studiul a fost realizat pe 5 loturi de prepeliţe. Remediul BioR a fost administrat de două ori: la începutul studiului şi la 7-10 zile după prima administrare, în doze diferite. S-a constatat că administrarea remediului BioR determină îmbunătăţirea indicilor sistemului PLO - SAO şi activitatea majorităţii indicilor evaluaţi depinde direct sau indirect de doza utilizată, momente ce trebuie să fie luate în considerare atunci când se alege doza optimă a remediului.
Recognition of the simple group Sz(q), for some q by character degree graph and order [Articol]
(Moldova State University, 2025) Momen, Zahra
Let G be a finite group. The character degree graph of G, which is denoted by ?(G), is the graph whose vertices are the prime divisors of the irreducible character degrees of G and two vertices p and p0 are joined by an edge if pp0 divides some irreducible character degree of G. In this paper, we prove that the simple group Sz(q), for some q, is uniquely determined by its character degree graph and its order. This implies that Sz(q) is uniquely determined by the structure of its complex group algebra.
Endomorphisms of abelian group isotope semisymmetrizations [Articol]
(Moldova State University, 2025) Lewis, Kyle M.
Semisymmetrization and Mendelsohnization allow quasigroup homotopies to be reduced to homomorphisms. We demonstrate the semisymmetrization of an abelian group isotope is isomorphic to the direct product of its Mendelsohnization and another specific isotope if and only if its order is not divisible by 3. We also provide an example of a quasigroup such that the idempotent replica of its semisymmetrization is trivial.
Magnifiers in some semigroups of partial transformations [Articol]
(Moldova State University, 2025) Khirabdhi, Sushree; Singh, Shubh N.
Let P(X) be the semigroup of all partial transformations on a set X. For a nonempty subset Y of X and a submonoid S(Y ) of P(Y ), denote by PS(Y )(X) the semigroup of all partial transformations f 2 P(X) such that the restriction fjY of f to Y belongs to S(Y ). We describe left and right magnifiers in PS(Y )(X). We apply these general results to describe magnifiers in PI(Y )(X), where I(Y ) is the symmetric inverse semigroup on Y . We identify corresponding known results on PP(Y )(X) and P (Y )(X), where (Y ) is the submonoid of P(Y ) consisting of all partial surjective transformations on Y .
Experimental results on the number of perfect matchings in graphs of latin rectangles [Articol]
(Moldova State University, 2025) Iftikhar, Fariha; Nagy, Gábor P.
Latin rectangles, perfect matchings, and 1-factorizations of regular bipartite graphs are closely related through combinatorial constructions. We give a survey of classical results concerning the existence and enumeration of perfect matchings in bipartite graphs, including König’s and Hall’s theorems, as well as lower bounds provided by van der Waerden, Voorhoeve, and Schrijver. We discuss the connection between Latin rectangles and k-factorizations of regular bipartite graphs, highlighting that every k n Latin rectangle corresponds to a k-regular bipartite graph with 2n vertices. In 1986, Bollobás and McKay presented the asymptotic estimate for the expected number of perfect matchings in random k-regular bipartite graphs. Motivated by this probabilistic result, we performed numerical experiments on the average number of perfect matchings in random 3-regular bipartite graphs arising from Latin rectangles. Our computational results, based on calculating matrix permanents for subsets of Latin squares, show strong agreement with the Bollobás-McKay asymptotic formula.