Artículos (Matemática Aplicada I)

URI permanente para esta colecciónhttps://hdl.handle.net/11441/10894

Examinar

Mostrando 1 - 20 de 800

Latin bitrades derived from quasigroup autoparatopisms
(Springer, 2025) Cavenagh, Nicholas J.; Falcón Ganfornina, Raúl Manuel; Matemática Aplicada I (ETSII); Universidad de Sevilla
In 2008, Cavenagh, Drápal and Hämäläinen described a method of constructing Latin trades using groups. The Latin trades that arise from this construction are entry-transitive (that is, there always exists an autoparatopism of the Latin trade mapping any ordered triple to any other ordered triple). Moreover, useful properties of the Latin trade can be established using properties of the group. However, the construction does not give a direct embedding of the Latin trade into any particular Latin square. In this paper , we propose a similar approach to the above to construct Latin trades embedded in a Latin square L, via the autoparatopism group of the quasigroup with Cayley table L. We apply this theory to identify non-trivial entry-transitive trades in some group operation tables as well as in Latin squares that arise from quadratic orthomorphisms. Explore related subjects
Physics-based stabilized finite element approximations of the Poisson–Nernst–Planck equations
(Elsevier Science, 2025) Bonilla, Jesús; Gutiérrez Santacreu, Juan Vicente; Matemática Aplicada I (ETSII); Ministerio de Ciencia e Innovación (MICIN). España; Consejería de Economía, Conocimiento, Empresas y Universidad
We present and analyze two stabilized finite element methods for solving numerically the Poisson–Nernst–Planck equations. The stabilization we consider is carried out by using a shock detector and a discrete graph Laplacian operator for the ion equations, whereas the discrete equation for the electric potential need not be stabilized. Discrete solutions stemmed from the first algorithm preserve both maximum and minimum discrete principles. For the second algorithm, its discrete solutions are conceived so that they hold discrete principles and obey an entropy law provided that an acuteness condition is imposed for meshes. Remarkably the latter is found to be unconditionally stable. We validate our methodology through transient numerical experiments that show convergence toward steady-state solutions.
Partial functions induced by morphisms between of persistence modules
(Universitat Jaume I, 2023) González Díaz, Rocío; Soriano Trigueros, Manuel; Torras Casas, Álvaro; Matemática Aplicada I (ETSII); Agencia Estatal de Investigación. España; Agencia Andaluza del Conocimiento
Persistence modules are fundamental algebraic structures in topological data analysis. One often needs to understand morphisms between a pair of persistence modules as these appear very naturally in practical situations. Even though one might express such morphisms as the direct sum of indecomposable modules, in most cases the decomposition is out of our reach. We define an easy-to-compute partial function relating the interval decomposition of the domain and codomain of such morphisms. This approach gives information about the inner structure of the morphism in a computable way, allowing their use in topological data analysis.
Well-balanced POD-based reduced-order models for finite volume approximation of hyperbolic balance laws
(Elsevier Science , 2025-05-04) Gómez Bueno, Irene; Fernández Nieto, Enrique Domingo; Rubino, Samuele; Matemática Aplicada I (ETSII); Ministerio de Ciencia e Innovación (MICIN). España
This paper introduces a reduced-order modeling approach based on finite volume methods for hyperbolic systems, combining Proper Orthogonal Decomposition (POD) with the Discrete Empirical Interpolation Method (DEIM) and Proper Interval Decomposition (PID). Applied to systems such as the transport equation with source term, non-homogeneous Burgers equation, and shallow water equations with non-flat bathymetry and Manning friction, this method achieves significant improvements in computational efficiency and accuracy compared to previous time averaging techniques. A theoretical result justifying the use of well-balanced FullOrder Models (FOMs) is presented. Numerical experiments validate the approach, demonstrating its accuracy and efficiency. Furthermore, the question of prediction of solutions for systems that depend on some physical parameters is also addressed, and a sensitivity analysis on POD parameters confirms the model’s robustness and efficiency in this case.
Urban-scale building assessment and energy vulnerability mapping through an interactive geo-referenced web tool: demonstration applicability to southern Spain
(Springer, 2025-06-27) Calama-González, Carmen María; Escandón Ramírez, Rocío; Suárez, Rafael; Abajo Casado, María Encarnación; Diánez Martínez, Ana Rosa; Estructuras de Edificación e Ingeniería del Terreno; Construcciones Arquitectónicas I (ETSA); Matemática Aplicada I (ETSII); European Commission (EC). Fondo Europeo de Desarrollo Regional (FEDER); Junta de Andalucía; TEP999: HABITAE: Habitabilidad, Acondicionamiento y Energía en Arquitectura; FQM240: Invariantes en Teoría de Grafos y Optimización
Building decarbonization through energy renovation is a key challenge across the European Union, particularly in social housing sectors marked by high vulnerability. To support this goal, this study introduces a GIS-based open-access web tool for evaluating the energy performance and social vulnerability of the existing residential stock at the urban scale. The tool integrates data from public and open-source databases into a georeferenced environment, enabling systematic characterization of geometric, constructional, energy and social parameters at the urban-level, and supporting bottom-up and top-down approaches. This allows for performance evaluations, simulation model construction and the identification of high-priority buildings through energy and socioeconomic vulnerability indicators. Results from the city of Seville, used as a case study involving 2,888 dwellings) reveal that over 90% of buildings present severe winter energy vulnerability, while summer vulnerability is generally low. Socioeconomic analysis shows that more than a third of buildings house users living in severe poverty conditions. The combined vulnerability index highlights specific neighbourhoods, such as Polígono Sur, with particularly acute vulnerability levels. The tool’s scalability was demonstrated by extending it to 41 municipalities in southern Spain. This study concludes that this approach enables detailed diagnosis of structural and energy-related inequalities, integrating and analysing existing open data to perform thorough building performance assessment at urban level, and offers a rapid and reliable method for acquiring key building data and ensuring long-term adaptability through continuous updates.
Automorphism group schemes of special simple Jordan pairs of types I and IV
(Elsevier, 2025-10-01) Aranda Orna, Diego; Daza García, Alberto; Matemática Aplicada I (ETSII)
In this work, the automorphism group schemes of finite-dimensional simple Jordan pairs of types I and IV, and of some Jordan triple systems related to them, are determined. We assume char F=2 for the base field F.
On the Total Version of Triple Roman Domination in Graphs
(MDPI, 2025) Valenzuela-Tripodoro, Juan Carlos; Mateos-Camacho, Maria Antonia; Cera López, Martín; Álvarez-Ruiz, María Pilar; Matemática Aplicada I (ETSII)
In this paper, we describe the study of total triple Roman domination. Total triple Roman domination is an assignment of labels from {0, 1, 2, 3, 4} to the vertices of a graph such that every vertex is protected by at least three units either on itself or its neighbors while ensuring that none of its neighbors remains unprotected. Formally, a total triple Roman dominating function is a function f : V(G) → {0, 1, 2, 3, 4} such that f (N[v]) ≥ |AN(v)| + 3, where AN(v) denotes the set of active neighbors of vertex v, i.e., those assigned a positive label. We investigate the algorithmic complexity of the associated decision problem, establish sharp bounds regarding graph structural parameters, and obtain the exact values for several graph families.
An expected goals on target (xGOT) model: accounting for goalkeeper performance in football
(MDPI, 2025-03-10) Cruz Torres, Blanca de la; Navarro Castro, Miguel; Ruiz de Alarcón Quintero, Anselmo; Fisioterapia; Matemática Aplicada I (ETSII)
A key challenge in utilizing the expected goals on target (xGOT) metric is the limited public access to detailed football event and positional data, alongside other advanced metrics. This study aims to develop an xGOT model to evaluate goalkeeper (GK) performance based on the probability of successful actions, considering not only the outcomes (saves or goals conceded) but also the difficulty of each shot faced. Formal definitions were established for the following: (i) the initial distance between the ball and the GK at the moment of the shot, (ii) the distance between the ball and the GK over time post-shot, and (iii) the distance between the GK’s initial position and the goal, with respect to the y-coordinate. An xGOT model incorporating geometric parameters was designed to optimize performance based on the ball position, trajectory, and GK positioning. The model was tested using shots on target from the 2022 FIFA World Cup. Statistical evaluation using k-fold cross-validation yielded an AUC-ROC score of 0.67 and an 85% accuracy, confirming the model’s ability to differentiate successful GK performances. This approach enables a more precise evaluation of GK decision-making by analyzing a representative dataset of shots to estimate the probability of success.
A multilayer shallow water model for tsunamis and coastal forest interaction
(EDP Sciences, Société de Mathématiques Appliquées et Industrielles, 2025) Bürger, Raimund; Fernández Nieto, Enrique Domingo; Moya Abuhadba, Jorge Johnny; Matemática Aplicada I (ETSII); Gobierno de España; European Commission (EC). Fondo Europeo de Desarrollo Regional (FEDER); FQM120: Modelado Matemático y Simulación de Sistemas Medioambientales
Models and numerical methods of the impact of tsunamis on coastal forests are of vital importance for exploring the potential of coastal vegetation as a means of mitigation. Such a model is formulated as a multilayer shallow water system based on a free-surface formulation of the Euler equations for an ideal fluid. Specifically, the Euler equations are approximated by a layer averaged non-hydrostatic (LDNH) approach involving linear pressures and piecewise constant velocities. Furthermore, based on [Iimura and Tanaka, Ocean Eng. 54 (2012) 223–232] drag forces, inertia forces, and porosity are added to model the interaction with the forest. These ingredients are specified in a layer-wise manner. Thus, the vertical features of the forest are described with higher accuracy than within a single-layer approach. Projection methods for the non-hydrostatic pressure in conjunction with polynomial viscosity matrix finite volume methods [Castro and Fernández-Nieto, SIAM J. Sci. Comput. 34 (2012) A2173–A2196] are employed for the numerical solution of the multilayer model, that is for the propagation of tsunamis and coastal flooding. Experimental observations and field data are used to validate the model. In general good agreement is obtained.
A series of two-phase models for grain–fluid flows with dilatancy
(2025-04-04) Bouchut, François; Drach, Elias; Fernández Nieto, Enrique Domingo; Mangeney, Anne; Narbona Reina, Gladys; Matemática Aplicada I (ETSII); Ministerio de Ciencia e Innovación (MICIN). España; Junta de Andalucía; FQM120: Modelado Matemático y Simulación de Sistemas Medioambientales
Debris flows are a growing natural hazard as a result of climate change and population density. To effectively assess this hazard, simulating field-scale debris flows at a reasonable computational cost is crucial. We enhance existing debris flow models by rigorously deriving a series of depth-averaged shallow models with varying complexities describing the behaviour of grain–fluid flows, considering granular mass dilatancy and pore fluid pressure feedback. The most complete model includes a mixture layer with an upper fluid layer, and solves for solid and fluid velocity in the mixture and for the upper fluid velocity. Simpler models are obtained by assuming velocity equality in the mixture or single-layer descriptions with a virtual thickness. Simulations in a uniform configuration mimicking submarine landslides and debris flows reveal that these models are extremely sensitive to the rheology, the permeability (grain diameter) and initial volume fraction, parameters that are hard to measure in the field. Notably, velocity equality assumptions in the mixture hold true only for low permeability (corresponding to grain diameter d=10−3 m). The one-layer models’ results can strongly differ from those of the complete model, for example, the mass can stop much earlier. One-layer models, however, provide a rough estimate of two-layer models when permeability is low, initial volume fraction is far from critical and the upper fluid layer is very thin. Our work with uniform settings highlights the need of developing two-layer models accounting for dilatancy and for an upper layer made either of fluid or grains.
Optimal secret share distribution in degree splitting communication networks
(AMER INST MATHEMATICAL SCIENCES-AIMS, 2023-10-13) Falcón Ganfornina, Raúl Manuel; Aparna, Venkitachalam; Mohanapriya, Nagaraj; Matemática Aplicada I (ETSII)
Dynamic coloring has recently emerged as a valuable tool to optimize cryptographic protocols based on secret sharing, which enforce data security in communication networks and have significant importance in both online storage and cloud computing. This type of graph labeling enables the dealer to distribute secret shares among the nodes of a communication network so that everybody can recover the secret after a minimum number of rounds of communication. This paper delves into this topic by dealing with the dynamic coloring problem for degree splitting graphs. The topological structure of the latter enables the dealer to avoid dishonesty by adding control nodes that supervise all those participants with a similar influence in the network. More precisely, we solve the dynamic coloring problem for degree splitting graphs of any regular graph. The irregular case is partially solved by establishing a lower bound for the corresponding dynamic chromatic number. As illustrative examples, we solve the dynamic coloring problem for the degree splitting graphs of cycles, cocktail, book, comb, fan, jellyfish, windmill and barbell graphs.
A rockslide-generated tsunami in a Greenland fjord rang Earth for 9 days
(AMER ASSOC ADVANCEMENT SCIENCE, 2024-09-12) Svennevig, Kristian; Hicks, Stephen P.; Forbriger, Thomas; Lecocq, Thomas; Widmer-Schnidrig, Rudolf; Mangeney, Anne; Fernández Nieto, Enrique Domingo; Wirtz, Bastien; Matemática Aplicada I (ETSII)
Climate change is increasingly predisposing polar regions to large landslides. Tsunamigenic landslides have occurred recently in Greenland (Kalaallit Nunaat), but none have been reported from the eastern fjords. In September 2023, we detected the start of a 9-day-long, global 10.88-millihertz (92-second) monochromatic very-long-period (VLP) seismic signal, originating from East Greenland. In this study, we demonstrate how this event started with a glacial thinning–induced rock-ice avalanche of 25 × 106 cubic meters plunging into Dickson Fjord, triggering a 200-meter-high tsunami. Simulations show that the tsunami stabilized into a 7-meter-high long-duration seiche with a frequency (11.45 millihertz) and slow amplitude decay that were nearly identical to the seismic signal. An oscillating, fjord-transverse single force with a maximum amplitude of 5 × 1011 newtons reproduced the seismic amplitudes and their radiation pattern relative to the fjord, demonstrating how a seiche directly caused the 9-day-long seismic signal. Our findings highlight how climate change is causing cascading, hazardous feedbacks between the cryosphere, hydrosphere, and lithosphere.
A dynamic geometry system approach to analyse distance geometry problems based on partial Latin squares
(Taylor & Francis Inc, 2020) Falcón Ganfornina, Raúl Manuel
Partial Latin squares constitute an interesting approach to improve the teaching of different subjects in the mathematics classroom. This paper delves into this topic by introducing the use of a Dynamic Geometry System to deal with these combinatorial structures as a source of loci of points in the Euclidean plane. It is assumed to this end that the distance matrix among all these points contains a zerodiagonal symmetric partial Latin square with at least one non-zero filled cell per row.
Well-Posedness and Stability Analysis of a Landscape Evolution Model
(Springer anature, 2024) Binard, Julie; Degond, P.; Noble, P.; Matemática Aplicada I (ETSII)
In this paper, we study a system of partial differential equations modeling the evolution of a landscape in order to describe the mechanisms of pattern formations. A ground surface is eroded by the flow of water over it, by either sedimentation or dilution. We consider a model, composed of three evolution equations: one on the elevation of the ground surface, one on the fluid height and one on the concentration of sediments in the fluid layer. We first establish the well-posedness of the system in short time and under the assumption that the initial fluid height does not vanish. Then, we focus on pattern formation in the case of a film flow over an inclined erodible plane. For that purpose, we carry out a spectral stability analysis of constant state solutions in order to determine instability conditions and identify a mechanism for pattern formations. These patterns, which are rills and gullies, are the starting point of the formation of rivers and valleys in landscapes. Finally, we carry out some numerical simulations of the full system in order to validate the spectral instability scenario, and determine the resulting patterns.
Solvable Lie and Leibniz superalgebras with a given nilradical
(Walter de Gruyter GmbH, 2020) Camacho Santana, Luisa María; Fernández Barroso, José Manuel; Navarro, Rosa María; Matemática Aplicada I (ETSII)
Throughout this paper we show that under certain conditions the method for describing solvable Leibniz (resp. Lie) algebras with given nilradical by means of non-nilpotent outer derivations of the nilradical is also applicable to the case Leibniz (resp. Lie) superalgebras. Moreover, after having established the general method for Lie and Leibniz superalgebras, we classify all the solvable superalgebras on a very important class of each of them, that is, those with nilradical of maximal nilindex. Note that for (n+m)-dimensional superalgebras this maximal nilindex is n+m−1 in the Lie case and n+m in Leibniz.
p-Strong Roman Domination in Graphs
(World Scientific and Engineering Academy and Society, 2024) Valenzuela-Tripodoro, J. C.; Mateos-Camacho, M. A.; Cera López, Martín; Moreno Casablanca, Rocío; Álvarez-Ruiz, M. P.; Matemática Aplicada I (ETSII); Matemática Aplicada II (ETSI)
Power concave operators and representation of p-convex and q-concave banach lattices
(Theta Foundation, 2017) Delgado Garrido, Olvido; Sánchez Pérez, Enrique A.; Matemática Aplicada I (ETSII)
As a consequence of the analysis of the class of (p, q)-power concave operators, we prove a general representation theorem for p-convex and q-concave Banach lattices as spaces of integrable functions with respect to vector measures. This result culminates a series of representation theorems for Banach lattices using vector measures that have been obtained in the last twenty years.
Optimization of laser scanner positioning networks for architectural surveys through the design of genetic algorithms
(Elsevier, 2021) Cabrera Revuelta. Elena; Chávez de Diego, María José; Barrera Vera, José Antonio; Fernández Rodríguez, Yago; Caballero Sánchez, Manuel; Matemática Aplicada I (ETSII); Ingeniería Gráfica
In recent decades, the use of terrestrial laser scanners has become the principal method for metric data collection in architecture. However, there are no systematic procedures in place to plan the data capture process. This means that the obtaining tasks of the clouds of points are based either on operator experience, or on the overlap register that grants a complete acquisition. In both cases, data redundancy represents a significant percentage, which forces subsequent filtration or point removal. This work describes the design and development of an automated methodology, based on genetic algorithms, for the selection of a set of positions from which to execute the data capture process. The algorithm designed herein is applied to a variety of cases, thereby attaining the best station-positioning network for data collection, which maximizes coverage and minimizes overlap between clouds of points.
Gradings on associative triple systems of the second kind
(Elsevier Science, 2024) Daza García, Alberto; Matemática Aplicada I (ETSII)
On this work we study associative triple systems of the second kind. We show that for simple triple systems the automor-phism group scheme is isomorphic to the automorphism group scheme of the 3-graded associative algebra with involution constructed by Loos. This result will allow us to prove our main result which is a complete classification up to isomor-phism of the gradings of structurable algebras.
Further Results on the [k]-Roman Domination in Graphs
(Springer Nature, 2024) Valenzuela-Tripodoro, Juan Carlos; Mateos-Camacho, Maria Antonia; Cera López, Martín; Álvarez-Ruiz, Maria Pilar; Matemática Aplicada I (ETSII)
In 2016, Beeler et al. defined the double Roman domination as a variation of Roman domination. Sometime later, in 2021, Ahangar et al. introduced the concept of [k]- Roman domination in graphs and settled some results on the triple Roman domination case. In 2022, Amjadi et al. studied the quadruple version of this Roman-dominationtype problem. Given any labeling of the vertices of a graph, AN(v) stands for the set of neighbors of a vertex v having a positive label. In this paper we continue the study of the [k]-Roman domination functions ([k]-RDF) in graphs which coincides with the previous versions when 2 ≤ k ≤ 4. Namely, f is a [k]-RDF if f (N[v]) ≥ k+|AN(v)| for all v. We prove that the associate decision problem is NP-complete even when restricted to star convex and comb convex bipartite graphs and we also give sharp bounds and exact values for several classes of graphs.

Examinar

Envíos recientes