Now showing items 268-287 of 314

    • Icon

      The Acoustics of the Choir in Spanish Cathedrals  [Article]

      Alonso Carrillo, Alicia; Suárez Medina, Rafael Carlos; Sendra, Juan J. (MDPI, 2018-12)
      One of the most significant enclosures in worship spaces is that of the choir. Generally, from a historical point of view, the choir is a semi-enclosed and privileged area reserved for the clergy, whose position and ...
    • Icon

      The center of an infinite graph  [Article]

      Boza Prieto, Luis; Diánez Martínez, Ana Rosa; Márquez Pérez, Alberto (1996)
      In this note we extend the notion of the center of a graph to infinite graphs. Thus, a vertex is in the center of the infinite graph G if it is in the center of an increasing family of finite subgraphs covering G. We give ...
    • Icon

      The convolution theorem for the continuous wavelet tranform  [Article]

      Pérez Rendón, Antonio F.; Robles Arias, Rafael (Elsevier, 2004)
      We study the application of the continuous wavelet transform to perform signal 1ltering processes. We 1rst show that the convolution and correlation of two wavelet functions satisfy the required admissibility and regularity ...
    • Icon

      The derivations of some evolution algebras  [Article]

      Camacho Santana, Luisa María; Gómez Martín, José Ramón; Omirov, Bakhrom Abdazovich; Turdibaev, R. M. (Taylor and Francis, 2013)
      In this work we investigate the derivations of n−dimensional complex evolution algebras, depending on the rank of the appropriate matrices. For evolution algebra with non-singular matrices we prove that the space of ...
    • Icon

      The determining number of Kneser graphs  [Article]

      Cáceres González, José; Garijo Royo, Delia; González Herrera, Antonio; Márquez Pérez, Alberto; Puertas González, María Luz (2013)
      A set of vertices S is a determining set of a graph G if every automorphism of G is uniquely determined by its action on S. The determining number of G is the minimum cardinality of a determining set of G. This paper studies ...
    • Icon

      The determining number of Kneser graphs  [Article]

      Puertas González, María Luz; Cáceres González, José; Garijo Royo, Delia; González Herrera, Antonio; Márquez Pérez, Alberto (2013)
    • Icon

      The difference between the metric dimension and the determining number of a graph  [Article]

      Garijo Royo, Delia; González Herrera, Antonio; Márquez Pérez, Alberto (2014)
      We study the maximum value of the difference between the metric dimension and the determining number of a graph as a function of its order. We develop a technique that uses functions related to locating-dominating sets to ...
    • Icon

      The Gauss map of surfaces in PSL˜2(R)  [Article]

      Daniel, Benoit; Fernández Delgado, Isabel; Mira, Pablo (Springer, 2015)
      We define a Gauss map for surfaces in the universal cover of the Lie group PSL2(R) endowed with a left-invariant Riemannian metric having a 4-dimensional isometry group. This Gauss map is not related to the Lie group ...
    • Icon

      The general set in the MCIM Isotopic Model  [Article]

      Falcón Ganfornina, Raúl Manuel; Núñez Valdés, Juan (Springer Verlag, 2005)
      To obtain a bigger number of mathematical and physical applications of the Santilli’s isotheory, the latest studies have shown the necessity of analyzing isotopic models which use non associative laws. The main goal of ...
    • Icon

      The General Set in the MCIM isotopic model  [Article]

      Falcón Ganfornina, Raúl Manuel; Núñez Valdés, Juan (Springer, 2005)
      To obtain a bigger number of mathematical and physical applications of the Santilli's isotheory, the last studies have shown the neeed of analyzing isotopic models which use non associative laws. The main goal of this paper ...
    • Icon

      The homological reduction method for computing cocyclic Hadamard matrices  [Article]

      Álvarez Solano, Víctor; Armario Sampalo, José Andrés; Frau García, María Dolores; Real Jurado, Pedro (2009)
      An alternate method for constructing (Hadamard) cocyclic matrices over a finite group GG is described. Provided that a homological model View the MathML sourceB̄(Z[G])ϕ:⇌HFhG for GG is known, the homological reduction ...
    • Icon

      The maximum relative diameter for multi-rotationally symmetric planar convex bodies  [Article]

      Cañete Martín, Antonio Jesús (Ele-Math, 2016)
      In this work we study the maximum relative diameter functional dM in the class of multi-rotationally symmetric planar convex bodies. A given set C of this class is k-rotationally symmetric for k 2 {k1, . . . , kn} N, ...
    • Icon

      The Menger number of the strong product of graphs  [Article]

      Abajo Casado, María Encarnación; Moreno Casablanca, Rocío; Diánez Martínez, Ana Rosa; García Vázquez, Pedro (Elsevier, 2013)
      The xy-Menger number with respect to a given integer ℓ, for every two vertices x, y in a connected graph G, denoted by ζℓ(x, y), is the maximum number of internally disjoint xy-paths whose lengths are at most ℓ in G. The ...
    • Icon

      The mRNA degradation factor Xrn1 regulates transcription elongation in parallel to Ccr4  [Article]

      Begley, Victoria Sarah; Corzo García, Daniel; Jordán Pla, Antonio; Cuevas Bermúdez, Abel; Miguel Jiménez, María Dolores De; Pérez Aguado, David; Machuca Ostos, Mercedes; Navarro Gómez, Francisco; Chávez de Diego, María José; Pérez Ortín, José Enrique; Chávez de Diego, Sebastián (Oxford University Press, 2019-10-10)
      Co-transcriptional imprinting of mRNA by Rpb4 and Rpb7 subunits of RNA polymerase II (RNAPII) and by the Ccr4–Not complex conditions its posttranscriptional fate. In turn, mRNA degradation factors like Xrn1 are able to ...
    • Icon

      The number of conformally equivalent maximal graphs  [Article]

      Fernández Delgado, Isabel (Springer, 2010)
      We show that the number of entire maximal graphs with finitely many singular points that are conformally equivalent is a universal constant that depends only on the number of singularities, namely 2n for graphs with n + ...
    • Icon

      The path-variance problem on tree networks  [Article]

      Cáceres Sansaloni, María Teresa; López de los Mozos Martín, María Cruz; Mesa López-Colmenar, Juan Antonio (Elsevier, 2004)
      Extensive facility location models on graphs deal with the location of a special type of subgraphs such as paths, trees or cycles and can be considered as extensions of classical point location models. Variance is one of ...
    • Icon

      The resolving number of a graph  [Article]

      Garijo Royo, Delia; González Herrera, Antonio; Márquez Pérez, Alberto (2013)
      We study a graph parameter related to resolving sets and metric dimension, namely the resolving number, introduced by Chartrand, Poisson and Zhang. First, we establish an important difference between the two parameters: ...
    • Icon

      The set of autotopisms of partial Latin squares  [Article]

      Falcón Ganfornina, Raúl Manuel (2011)
      Symmetries of a partial Latin square are primarily determined by its autotopism group. Analogously to the case of Latin squares, given an isotopism Θ, the cardinality of the set P LSΘ of partial Latin squares which are ...
    • Icon

      The Size of a Graph Without Topological Complete Subgraphs  [Article]

      Cera López, Martín; Diánez Martínez, Ana Rosa; Márquez Pérez, Alberto (2000)
      In this note we show a new upperbound for the function ex(n;TKp), i.e., the maximum number of edges of a graph of order n not containing a subgraph homeomorphic to the complete graph of order p. Further, for ${\left \lceil ...
    • Icon

      The thermistor problem with degenerate thermal conductivity and metallic conduction  [Article]

      González Montesinos, María Teresa; Ortegón Gallego, Francisco (American Institute of Mathematical Sciences, 2007)
      The aim of this work is to establish the existence of a capacity solution to the thermistor problem supposing that the thermal and the electrical conductivities are not bounded below by a positive constant value. ...