Now showing items 1-20 of 43

    • A mathematical model for dynamic memory networks 

      Fàbrega Canudas, José; Fiol Mora, Miquel Àngel; Serra Albó, Oriol; Andrés Yebra, José Luis (Iniciativa Digital Politècnica, 2011)
      Conference report
      Open Access
      The aim of this paper is to bring together the work done several years ago by M.A. Fiol and the other authors to formulate a quite general mathematical model for a kind of permutation networks known as dynamic memories. A ...
    • An algebraic model for the storage of data in parallel memories 

      Fiol Mora, Miquel Àngel; Serra Albó, Oriol (Springer, 1989)
      Part of book or chapter of book
      Open Access
      The use of SIMD computers requires efficient schemes of storage of data in order to have conflict-free acces in parallel computation. In this paper we restate the problem of finding such chemes in an algebraic context. ...
    • An analogue of Vosper's theorem for extension fields 

      Bachoc, Christine; Serra Albó, Oriol; Zemor, Gilles (2017-11-01)
      Article
      Open Access
      We are interested in characterising pairs S, T of F-linear subspaces in a field extension L/F such that the linear span ST of the set of products of elements of S and of elements of T has small dimension. Our central result ...
    • COMBINATÒRIA (Examen 1r quadrim) 

      Serra Albó, Oriol (Universitat Politècnica de Catalunya, 2009-01-22)
      Exam
      Restricted access to the UPC academic community
    • COMBINATÒRIA I TEORIA DE GRAFTS | FINAL 

      Serra Albó, Oriol (Universitat Politècnica de Catalunya, 2017-01-15)
      Exam
      Restricted access to the UPC academic community
    • COMBINATÒRIA I TEORIA DE GRAFTS | FINAL 

      Serra Albó, Oriol (Universitat Politècnica de Catalunya, 2016-01-15)
      Exam
      Restricted access to the UPC academic community
    • COMBINATÒRIA I TEORIA DE GRAFTS | FINAL 

      Serra Albó, Oriol (Universitat Politècnica de Catalunya, 2019-01-15)
      Exam
      Restricted access to the UPC academic community
    • COMBINATÒRIA I TEORIA DE GRAFTS | PARCIAL 

      Serra Albó, Oriol (Universitat Politècnica de Catalunya, 2017-11-14)
      Exam
      Restricted access to the UPC academic community
    • COMBINATÒRIA I TEORIA DE GRAFTS | PARCIAL 

      Serra Albó, Oriol (Universitat Politècnica de Catalunya, 2018-10-25)
      Exam
      Restricted access to the UPC academic community
    • Combinàtoria i Teoria de Grafs | final 

      Serra Albó, Oriol (Universitat Politècnica de Catalunya, 2018-01-09)
      Exam
      Restricted access to the UPC academic community
    • Correlation among runners and some results on the lonely runner conjecture 

      Perarnau, Guillem; Serra Albó, Oriol (2016-10-03)
      Article
      Open Access
      The Lonely Runner Conjecture, posed independently by Wills and by Cusick, states that for any set of runners running along the unit circle with constant different speeds and starting at the same point, there is a time where ...
    • Counting configuration-free sets in groups 

      Rué Perna, Juan José; Serra Albó, Oriol; Vena Cros, Lluís (2017-01-01)
      Article
      Open Access
      © 2017 Elsevier Ltd. We provide asymptotic counting for the number of subsets of given size which are free of certain configurations in finite groups. Applications include sets without solutions to equations in non-abelian ...
    • 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 ...
    • Cycle codes of graphs and MDS array codes 

      Serra Albó, Oriol; Zemor, Gilles (2009-07-30)
      Article
      Restricted access - publisher's policy
      We investigate how to colour edges of graph so that any two colours make up a spanning tree. This problem is equivalent to transforming the cycle code of a graph into a Maximum Distance Separable (MDS) array code. Adopting ...
    • General properties of c-circulant digraphs 

      Mora Giné, Mercè; Serra Albó, Oriol; Fiol Mora, Miquel Àngel (1988)
      Article
      Open Access
      A digraph is said to be a c-circulant if its adjacency matrix is c-circulant. This paper deals with general properties of this family of digraphs, as isomorphisms, regularity, strong connectivity, diameter and the relation ...
    • Matemàtica discreta | Extraordinari 

      Serra Albó, Oriol (Universitat Politècnica de Catalunya, 2019-06-28)
      Exam
      Restricted access to the UPC academic community
    • MATEMÀTICA DISCRETA | EXTRAORDINARI 

      Serra Albó, Oriol (Universitat Politècnica de Catalunya, 2020-07-06)
      Exam
      Restricted access to the UPC academic community
    • Matemàtica discreta | Final 

      Serra Albó, Oriol (Universitat Politècnica de Catalunya, 2019-06-03)
      Exam
      Restricted access to the UPC academic community
    • MATEMÀTICA DISCRETA | FINAL 

      Serra Albó, Oriol (Universitat Politècnica de Catalunya, 2018-06-06)
      Exam
      Restricted access to the UPC academic community
    • MATEMÀTICA DISCRETA | FINAL 

      Serra Albó, Oriol (Universitat Politècnica de Catalunya, 2017-06-06)
      Exam
      Restricted access to the UPC academic community