• Computing denumerants in numerical 3-semigroups 

      Aguiló Gost, Francisco de Asis L.; Llena, David (2018)
      Article
      Accés obert
      As far as we know, usual computer algebra packages can not compute denumerants for almost medium (about a hundred digits) or almost medium-large (about a thousand digits) input data in a reasonably time cost on an ordinary ...
    • Correlation among runners and some results on the lonely runner conjecture 

      Perarnau Llobet, Guillem; Serra Albó, Oriol (2016-10-03)
      Article
      Accés obert
      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 ...
    • Normal limiting distributions for systems of linear equations in random sets 

      Rué Perna, Juan José; Wotzel, Maximilian (Elsevier, 2022-09-15)
      Article
      Accés obert
      We consider the binomial random set model where each element in is chosen independently with probability . We show that for essentially all regimes of p and very general conditions for a matrix A and a column vector b, the ...
    • The Frobenius problem: a geometric approach 

      Barrière Figueroa, Eulalia; Miralles de la Asunción, Alicia (2007-07)
      Article
      Accés obert
      For the well known Frobenius problem, we present a new geometric approach, based on the use of the $n$-dimensional lattice $\mathbb{Z}^n$, where $n$ is the number of generators. Within this approach we are able to study ...