Recent Submissions

  • Counting configuration–free sets in groups 

    Rué Perna, Juan José; Serra Albó, Oriol; Vena Cros, Lluís (2015)
    Conference lecture
    Restricted access - publisher's policy
    We present a unified framework to asymptotically count the number of sets, with a given cardinality, free of certain configurations. This is done by combining the hypergraph containers methodology joint with arithmetic ...
  • On sets of vectors of a finite vector space in which every subset of basis size is a basis II 

    Ball, Simeon Michael; De Beule, Jan (2012-10)
    Article
    Open Access
    This article contains a proof of the MDS conjecture for k = 2p - 2. That is, that if S is a set of vectors of F k q in which every subset of S of size k is a basis, where q = p h, p is prime and q is not and k = 2p - 2, ...
  • Langford sequences and a product of digraphs 

    López Masip, Susana Clara; Muntaner Batle, Francesc Antoni (2015-12-07)
    Article
    Restricted access - publisher's policy
    Skolem and Langford sequences and their many generalizations have applications in numerous areas. The ¿h-product is a generalization of the direct product of digraphs. In this paper we use the ¿h-product and super edge-magic ...
  • Conjugacy in houghton's groups 

    Antolin, Yago; Burillo Puig, José; Martino, Armando (2015)
    Article
    Open Access
    Let n ∈ N. Houghton’s group Hn is the group of permutations of {1, . . . , n} × N, that eventually act as a translation in each copy of N. We prove the solvability of the conjugacy problem and conjugator search problem for ...
  • Lissajous curves: an experiment in creative coding 

    Barrière Figueroa, Eulalia (2015)
    Conference lecture
    Restricted access - publisher's policy
    Do you want to become a creative coder for a day? When artists use a computer to make art, they often experience the need of improving their mathematical skills. On the other hand, students with technical skills are less ...
  • Proyecto, desarrollo y valoración en la UPC de un caso de feedforwarding en campus virtual 

    Fabregat Fillet, Jaume; Pelayo Melero, Ignacio Manuel; Valero Baya, Jordi; Ornat Longarón, Cèsar; Achaerandio Puente, María Isabel; Pineda Soler, Eloi; Buenestado Caballero, Pablo (Universitat Politècnica de València, 2015)
    Conference report
    Open Access
    Docentes de UPC, UB, UAB, UIB, UOC y URV investigamos sobre una evaluación formativa "feedforwarding", que realimente de inmediato, que no se limite al "correcto-incorrecto", que guíe más que resuelva, que sea suficientemente ...
  • The diameter of cyclic Kautz digraphs 

    Böhmová, Katerina; Dalfó Simó, Cristina; Huemer, Clemens (2015-11-12)
    Article
    Restricted access - publisher's policy
    A prominent problem in Graph Theory is to find extremal graphs or digraphs with restrictions in their diameter, degree and number of vertices. Here we obtain a new family of digraphs with minimal diameter, that is, given ...
  • On middle cube graphs 

    Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel; Mitjana Riera, Margarida (2015)
    Article
    Open Access
    We study a family of graphs related to the $n$-cube. The middle cube graph of parameter k is the subgraph of $Q_{2k-1}$ induced by the set of vertices whose binary representation has either $k-1$ or $k$ number of ones. The ...
  • Quasiperfect domination in trees 

    Cáceres, José; Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Puertas, M. Luz (2015-12-18)
    Article
    Restricted access - publisher's policy
    A k–quasiperfect dominating set ( k=1k=1) of a graph G is a vertex subset S such that every vertex not in S is adjacent to at least one and at most k vertices in S. The cardinality of a minimum k–quasiperfect dominating ...
  • The spectral excess theorem for distance-regular graphs having distance-d graph with fewer distinct eigenvalues 

    Fiol Mora, Miquel Àngel (2015-01-01)
    Article
    Restricted access - publisher's policy
    Let G be a distance-regular graph with diameter d and Kneser graph K=Gd, the distance-d graph of G. We say that G is partially antipodal when K has fewer distinct eigenvalues than G. In particular, this is the case of ...

View more