Alejandro Puga

Dr. Alejandro Puga

Física, Universidad Autónoma de Zacatecas, Zacatecas, Mexico
orcid

Research Focus & Metrics

Academic Career Length

26Years (2001-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 July 2023 in Fungal Genetics and Biology
Verified
Journal Article
Closed access
EMEdgar Martínez-Galicia
Edgar Martínez-Galicia
AEAna Fernanda Flores Enríquez
Ana Fernanda Flores Enríquez
Alejandro PugaAlejandro Puga
Alejandro Puga
BGBraulio Gutiérrez-Medina
Braulio Gutiérrez-Medina

20 December 2012 in American Journal of Physics
Verified
Journal Article
Closed access
Alejandro PugaAlejandro Puga
Alejandro Puga
BMB. N. Miller
B. N. Miller
Many systems of interest at the forefront of technological development, for example, in quantum computation, consist of weakly interacting elements that obey quantum mechanics. A challenge for modern theoretical physics is to develop a systematic methodology for approaching these “open” quantum systems. In particular, applied mathematicians have formulated the method of transparent boundary conditions (TBCs) to model interacting quantum systems of infinite extent. Here, we consider a particular application of TBCs to the escape of a particle from a one-dimensional infinite well when one of the bounding barriers is extinguished. We analytically obtain the exact time-dependent wave function by a Green's function method and then show that a numerical solution based on the TBC method is in excellent agreement. This work was motivated by an experiment carried out at the University of Texas on escape from a gravitational wedge billiard. Physicists have used billiards to understand and explore both classical and quantum chaos. Although the original experiment was carried out in the classical regime, current work is probing lower temperatures, where a quantum mechanical formulation is required.


24 July 2024 in Preprints.org
Verified
Preprint
Open access
PDF file
MLManuel de Jesus Luevano-Robledo
Manuel de Jesus Luevano-Robledo
Alejandro PugaAlejandro Puga
Alejandro Puga
In this work, several random Boolean networks (RBN) are generated and analyzed from two characteristics: their time evolution diagram and their transition diagram. To do this, its randomness is estimated using three measures, of which Algorithmic Complexity is the only one capable of both a) revealing transitions towards the chaotic regime, and b) disclosing the algorithmic contribution of certain states to the transition diagram and their relationship with the order they occupy in the temporal evolution of the respective RBN. The results obtained from both types of analysis are useful for the introduction of both Algorithmic Complexity and Perturbation Analysis in the context of Boolean networks, and their potential applications in regulatory network models.


28 September 2026 in Preprints.org
Verified
Preprint
Open access
PDF file
CVCarlos Adrian Capetillo Vázquez
Carlos Adrian Capetillo Vázquez
Alejandro PugaAlejandro Puga
Alejandro Puga
Ivan MorenoIvan Moreno
Ivan Moreno
TATonatiuh Saucedo Anaya
Tonatiuh Saucedo Anaya
Purpose: To classify optical filters with different filtering levels according to their algorithmic complexity and to evaluate their effects on visual acuity (VA). The Block Decomposition Method (BDM) was applied to classify optical filters based on their estimated algorithmic complexity. Methods: VA was measured in all participants. Optical filters were analyzed using conventional statistical methods together with the BDM to characterize their algorithmic complexity. Results: Selective absorption filters exhibited a progressive reduction in transmittance within the blue spectral region (380–500 nm), accompanied by a shift of the cutoff wavelength toward longer wavelengths and a reduction in effective bandwidth, while maintaining relatively stable overall visible transmittance. Shannon entropy analysis revealed a progressive increase in statistical diversity as filter treatment time increased. In contrast, the algorithmic complexity estimated using the BDM exhibited a non-linear behavior, reaching its highest values in filters treated for 1 and 2 minutes. VA analysis performed on 235 eyes showed that the algorithmic complexity of visual responses depended on the visual function evaluated. Resolution acuity exhibited a decreasing trend in the estimated algorithmic complexity of its computational representation, whereas alignment acuity showed an overall increase across filter conditions. Detection acuity displayed non-linear changes, while recognition acuity included the highest individual nBDM value among the visual functions evaluated. Conclusions: Algorithmic complexity provides a complementary approach to conventional statistical methods for the analysis of ophthalmic filters and visual responses. The results indicate that statistical diversity and estimated algorithmic complexity characterize distinct and complementary properties of the computational representations analyzed. Selective absorption filters were associated with changes in the computational organization of the transmittance spectra and with differences in the computational representations of visual responses. BDM provided information about algorithmic organization that was complementary to conventional descriptive statistics and Shannon entropy, supporting its potential use as an additional computational tool for the characterization of photoselective filters and their relationship with visual performance.