Search results for "MATEMATICA APLICADA"
showing 10 items of 277 documents
Solving fully randomized higher-order linear control differential equations: Application to study the dynamics of an oscillator
2021
[EN] In this work, we consider control problems represented by a linear differential equation assuming that all the coefficients are random variables and with an additive control that is a stochastic process. Specifically, we will work with controllable problems in which the initial condition and the final target are random variables. The probability density function of the solution and the control has been calculated. The theoretical results have been applied to study, from a probabilistic standpoint, a damped oscillator.
A Branch-Price-and-Cut Algorithm for the Min-Max k -Vehicle Windy Rural Postman Problem
2013
[EN] The min-max k -vehicles windy rural postman problem consists of minimizing the maximal distance traveled by a vehicle to find a set of balanced routes that jointly service all the required edges in a windy graph. This is a very difficult problem, for which a branch-and-cut algorithm has already been proposed, providing good results when the number of vehicles is small. In this article, we present a branch-price-and-cut method capable of obtaining optimal solutions for this problem when the number of vehicles is larger for the same set of required edges. Extensive computational results on instances from the literature are presented.
El origen de los trastornos mentales: un nuevo enfoque desde el estudio de la dinámica de la personalidad
2018
[EN] There is a growing consensus in the mental health sciences (psychology, psychiatry) that there is no clear dividing line between "normal" personality and "abnormal" personality or mental disorders. In fact, basic personality traits predispose or overlap with clinical mental disorders. For example, Neuroticism, as a factor that predisposes to neurosis, predisposes to suffer from anxiety, depression and obsessive disorders. This question serves to present a summary of the work of our group (Antonio Caselles, Joan C. Micó and Salvador Amigó) and to point out future research. Thus, after reviewing our studies on the dynamics of the General Personality Factor (FGP) and its biological substr…
A reduction theorem for a conjecture on products of two π -decomposable groups
2013
[EN] For a set of primes pi, a group X is said to be pi-decomposable if X = X-pi x X-pi' is the direct product of a pi-subgroup X-pi and a pi'-subgroup X-pi', where pi' is the complementary of pi in the set of all prime numbers. The main result of this paper is a reduction theorem for the following conjecture: "Let pi be a set of odd primes. If the finite group G = AB is a product of two pi-decomposable subgroups A = A(pi) x A(pi') and B = B-pi x B-pi', then A(pi)B(pi) = B(pi)A(pi) and this is a Hall pi-subgroup of G." We establish that a minimal counterexample to this conjecture is an almost simple group. The conjecture is then achieved in a forthcoming paper. (C) 2013 Elsevier Inc. All ri…
A note on a result of Guo and Isaacs about p-supersolubility of finite groups
2016
In this note, global information about a finite group is obtained by assuming that certain subgroups of some given order are S-semipermutable. Recall that a subgroup H of a finite group G is said to be S-semipermutable if H permutes with all Sylow subgroups of G of order coprime to . We prove that for a fixed prime p, a given Sylow p-subgroup P of a finite group G, and a power d of p dividing such that , if is S-semipermutable in for all normal subgroups H of P with , then either G is p-supersoluble or else . This extends the main result of Guo and Isaacs in (Arch. Math. 105:215-222 2015). We derive some theorems that extend some known results concerning S-semipermutable subgroups.
On the supersoluble hypercentre of a finite group
2016
[EN] We give some sufficient conditions for a normal p-subgroup P of a finite group G to have every G-chief factor below it cyclic. The S-permutability of some p-subgroups of O^p(G)plays an important role. Some known results can be reproved and some others appear as corollaries of our main theorems.
On self-normalising subgroups of finite groups
2010
[EN] The aim of this paper is to characterise the classes of groups in which every subnormal subgroup is normal, permutable, or S-permutable by the embedding of the subgroups (respectively, subgroups of prime power order) in their normal, permutable, or S-permutable closure, respectively.
On a graph related to permutability in finite groups
2010
For a finite group G we define the graph $\Gamma(G)$ to be the graph whose vertices are the conjugacy classes of cyclic subgroups of G and two conjugacy classes $\{\mathcal {A}, \mathcal {B}\}$ are joined by an edge if for some $\{A \in \mathcal {A},\, B \in \mathcal {B}\, A\}$ and B permute. We characterise those groups G for which $\Gamma(G)$ is complete.
The mixed general routing polyhedron
2003
[EN] In Arc Routing Problems, ARPs, the aim is to find on a graph a minimum cost traversal satisfying some conditions related to the links of the graph. Due to restrictions to traverse some streets in a specified way, most applications of ARPs must be modeled with a mixed graph. Although several exact algorithms have been proposed, no polyhedral investigations have been done for ARPs on a mixed graph. In this paper we deal with the Mixed General Routing Problem which consists of finding a minimum cost traversal of a given link subset and a given vertex subset of a mixed graph. A formulation is given that uses only one variable for each link (edge or arc) of the graph. Some properties of the…
The small-world of 'Le Petit Prince': Revisiting the word frequency distribution
2016
[EN] Many complex systems are naturally described through graph theory, and different kinds of systems described as networks present certain important characteristics in common. One of these features is the so-called scale-free distribution for its node s connectivity, which means that the degree distribution for the network s nodes follows a power law. Scale-free networks are usually referred to as small-world because the average distance between their nodes do not scale linearly with the size of the network, but logarithmically. Here we present a mathematical analysis on linguistics: the word frequency effect for different translations of the Le Petit Prince in different languages. Compar…