Searcharxiv⌕ Search

arXiv subjects

Ismael Gutierrez Garcia

Publications and source records attributed to Ismael Gutierrez Garcia.

4 recordsLinked to original sources

The category of formations of finite groups and topology

This paper explores the interplay between category theory, topology, and the algebraic theory of finite groups. Our analysis unfolds in three stages. First, we establish the foundational universe of our objects: the complete and cocomplete posetal category of group classes, $\mathrm{CG}$. Second, we formalize the collection of closure operators themselves as a category, \textbf{CL}, proving it is a complete lattice. This provides the essential machinery for combining algebraic operations and understanding their universal properties via adjunctions. Finally, we apply this framework to topology. We show that additive universally anchored operators induce homotopically equivalent contractible spaces, revealing a principle of global simplicity that contrasts with local algebraic friction. We then use the lattice structure of \textbf{CL} to analyze the operators for Formations and Fitting classes, uncovering a profound topological asymmetry between these dually defined structures.

math.CT↗

Some classes of non-archimedean radial probability density functions associated with energy landscapes

In this article, we study a large class of radial probability density functions defined on the p-adic numbers from which it is possible to obtain certain non-archimedean pseudo-differential operators. These operators are associated with certain p-adic master equations of some models of complex systems (such as glasses, macromolecules, and proteins). We prove via the theory of distributions some properties corresponding to the heat Kernel associated with these pseudo-differential operators. Also, study some properties corresponding to the fundamental solution of these p-adic equations. Finally, we will study strong Markov processes, the first passage time problem and the survival probability (of the trajectories of these processes) corresponding to radial probability density functions connected with energy landscapes of the linear and logarithmic types.

math-ph↗

On quasi-cyclic subspace codes

Construction of subspace codes with good parameters is one of the most important problems in random network coding. In this paper we present first a generalization of the concept of cyclic subspaces codes and further we show that the usual methods for constructing cyclic subspace codes over finite fields works for m-quasi cyclic codes, namely the subspaces polynomials and Frobenius mappings.

cs.IT↗

A module structure over maximal consistent sets

It is shown the construction of a module structure [2] with universe over a set of a particular kind of mathematical proofs, the base ring of this module will be built on a maximal consistent extension of a set of propositions, this provides the possibility to do some linear algebra on proofs. It will also be presented an algorithmic proceeding in order to deal with these particular type of deductions.

math.LO↗