Cesarean section has become one of the most frequently performed obstetric procedures worldwide and reflects complex interactions between maternal characteristics, reproductive history, and clinical conditions that emerge during pregnancy and childbirth. This study aimed to analyze the profile of mothers undergoing cesarean delivery through a descriptive literature review of scientific publications and national health reports. Relevant literature was obtained from reputable academic databases and official health documents to identify consistent patterns in maternal characteristics associated with cesarean delivery. The synthesis indicates that demographic attributes such as maternal age, education level, and socioeconomic conditions shape access to healthcare services and influence patterns of delivery management. Obstetric history, including parity, gestational age, and previous delivery experiences, also contributes to variations in delivery pathways and clinical decision-making. In addition, several medical indications, including hypertensive disorders of pregnancy, fetal distress, and other obstetric complications, represent important determinants underlying the performance of cesarean procedures. These interconnected factors demonstrate that cesarean delivery reflects not only clinical necessity but also broader maternal health profiles within healthcare systems. Understanding these multidimensional characteristics provides an important foundation for strengthening maternal health strategies and improving evidence-based obstetric care.
We describe a complete algorithm to compute millions of coefficients of classical modular forms in a few seconds. We also review operations on Euler products and illustrate our methods with a computation of triple product L-function of large conductor.
Flip graphs were recently introduced in order to discover new matrix multiplication methods for matrix sizes. The technique applies to other tensors as well. In this paper, we explore how it performs for polynomial multiplication.
Computer algebra systems are really good at factoring polynomials, i.e. writing f as a product of irreducible factors. It is relatively easy to verify that we have a factorisation, but verifying that these factors are irreducible is a much harder problem. This paper reports work-in-progress to do such verification in Lean.
Based on a theorem by Vasconcelos, we give an algorithm for equidimensional decomposition of algebraic sets using syzygy computations via Gröbner bases. This algorithm avoids the use of elimination, homological algebra and processing the input equations one-by-one present in previous algorithms. We experimentally demonstrate the practical interest of our algorithm compared to the state of the art.
Vivek Kumar, Mahendra Yadav, Kunal Dhankhar
et al.
The physicochemical properties of insoluble Prussian blue (PB) play an important role in its thallium binding ability. Therefore, the present study aimed to characterise various physicochemical parameters of PB available commercially and compare them with the USFDA-approved Radiogardase ® -Cs. In addition, PB was synthesised by indirect and direct methods. PB samples and Radiogardase®-Cs were analysed for various parameters like particle size, moisture content, and thermogravimetric analysis (TGA) and correlated with its Maximum Binding Capacity (MBC) for thallium. Radiogardase ® -Cs showed the highest MBC of 238 mg/g for thallium with D 90 of 785 μm and moisture content of 23.24 %. The MBC of other PB samples was found to be significantly lower than Radiogardase ® -Cs which was found to be directly proportional to the moisture content. However, other parameters like particle size, and iron content vary significantly but no correlation was observed with MBC for thallium. This finding suggests that moisture content and MBC are extremely important parameters for optimising the PB to achieve desirable pharmacological efficacy for removing thallium in vivo.
For a linear difference equation with the coefficients being computable sequences, we establish algorithmic undecidability of the problem of determining the dimension of the solution space including the case when some additional prior information on the dimension is available.
In this short article I introduce the "jordan" package which provides functionality for working with different types of Jordan algebra. I give some numerical verification of the Jordan identity for the five types of Jordan algebras. The package is available on CRAN at https://CRAN.R-project.org/package=stokes.
Here I present the freegroup package for working with the free group on a finite set of symbols. The package is vectorised; internally it uses an efficient matrix-based representation for free group objects but uses a configurable print method. A range of R-centric functionality is provided. It is available on CRAN at https://CRAN.R-project.org/package=freegroup.
The paper deals with the analytic complexity of solutions to bivariate holonomic hypergeometric systems of the Horn type. We obtain estimates on the analytic complexity of Puiseux polynomial solutions to the hypergeometric systems defined by zonotopes. We also propose algorithms of the analytic complexity estimation for polynomials.
In 1969, V. Strassen improves the classical~2x2 matrix multiplication algorithm. The current upper bound for 3x3 matrix multiplication was reached by J.B. Laderman in 1976. This note presents a geometric relationship between Strassen and Laderman algorithms. By doing so, we retrieve a geometric formulation of results very similar to those presented by O. Sykora in 1977.
We provide an algorithm for computing semi-Fourier sequences for expressions constructed from arithmetic operations, exponentiations and integrations. The semi-Fourier sequence is a relaxed version of Fourier sequence for polynomials (expressions made of additions and multiplications).
The deterministic recursive pivot-free algorithms for the computation of generalized Bruhat decomposition of the matrix in the field and for the computation of the inverse matrix are presented. This method has the same complexity as algorithm of matrix multiplication and it is suitable for the parallel computer systems.
This paper proposes a totally constructive approach for the proof of Hilbert's theorem on ternary quartic forms. The main contribution is the ladder technique, with which the Hilbert's theorem is proved vividly.
The Truncated Fourier Transform (TFT) is a variation of the Discrete Fourier Transform (DFT/FFT) that allows for input vectors that do NOT have length $2^n$ for $n$ a positive integer. We present the univariate version of the TFT, originally due to Joris van der Hoeven, heavily illustrating the presentation in order to make these methods accessible to a broader audience.
We present a divide-and-conquer version of the Cylindrical Algebraic Decomposition (CAD) algorithm. The algorithm represents the input as a Boolean combination of subformulas, computes cylindrical algebraic decompositions of solution sets of the subformulas, and combines the results. We propose a graph-based heuristic to find a suitable partitioning of the input and present empirical comparison with direct CAD computation.
Students of our department solve algebraic exercises in mathematical logic in a computerized environment. They construct transformations step by step and the program checks the syntax, equivalence of expressions and completion of the task. With our current project, we add a program component for checking relevance of the steps.
Let $\mathbb{Q}(α)$ and $\mathbb{Q}(β)$ be algebraic number fields. We describe a new method to find (if they exist) all isomorphisms, $\mathbb{Q}(β) \rightarrow \mathbb{Q}(α)$. The algorithm is particularly efficient if the number of isomorphisms is one.
In this paper, the changes of representations of a group are used in order to describe its action as algebraic Galois group of an univariate polynomial on the roots of factors of any Lagrange resolvent. By this way, the Galois group of resolvent factors are pre-determinated. In follows, different applications are exposed; in particular, some classical results of algebraic Galois theory.