Investigació en els camps de combinatòria enumerativa, combinatòria algebraica i teoria de grafs.

http://futur.upc.edu/MD

The aim is to carry out research in the fields of enumerative combinatorics, algebraic combinatorics and graph theory.

http://futur.upc.edu/MD

The aim is to carry out research in the fields of enumerative combinatorics, algebraic combinatorics and graph theory.

http://futur.upc.edu/MD

Enviaments recents

  • The conjugacy problem in extensions of Thompson's group F 

    Burillo Puig, José; Matucci, Francesco; Ventura Capell, Enric (2016-10-01)
    Article
    Accés restringit per política de l'editorial
    We solve the twisted conjugacy problem on Thompson’s group F. We also exhibit orbit undecidable subgroups of Aut(F), and give a proof that Aut(F) and Aut+(F) are orbit decidable provided a certain conjecture on Thompson’s ...
  • Extreme weights in Steinhaus triangles 

    Brunat Blay, Josep M.; Maureso Sánchez, Montserrat (2016-09-08)
    Article
    Accés restringit per política de l'editorial
    Let {0=w0<w1<w2<…<wm0=w0<w1<w2<…<wm} be the set of weights of binary Steinhaus triangles of size n , and let Wibe the set of sequences in F2n that generate triangles of weight wi. In this paper we obtain the values of wi ...
  • Degree of commutativity of infinite groups 

    Antolin, Yago; Martino, Armando; Ventura Capell, Enric (2016-11-16)
    Article
    Accés obert
    We prove that, in a finitely generated residually finite group of subexponential growth, the proportion of commuting pairs is positive if and only if the group is virtually abelian. In particular, this covers the case where ...
  • Perspectivas en combinatoria 

    Noy Serrano, Marcos; Serra Albó, Oriol (Real Sociedad Matemática Española, 2016-10-03)
    Article
    Accés obert
  • Computing the canonical representation of constructible sets 

    Brunat Blay, Josep Maria; Montes Lozano, Antonio (2016-03-08)
    Article
    Accés restringit per política de l'editorial
    Constructible sets are needed in many algorithms of Computer Algebra, particularly in the GröbnerCover and other algorithms for parametric polynomial systems. In this paper we review the canonical form ofconstructible sets ...
  • Bounding the gap between a free group (outer) automorphism and its inverse 

    Ladra, Manuel; Silva, Pedro V.; Ventura Capell, Enric (2016-09-01)
    Article
    Accés restringit per política de l'editorial
    For any finitely generated group GG , two complexity functions aGaG and ßGßG are defined to measure the maximal possible gap between the norm of an automorphism (respectively, outer automorphism) of GG and the norm ...
  • Algorithmic recognition of infinite cyclic extensions 

    Cavallo, Bren; Delgado Rodríguez, Jordi; Kahrobaei, Delaram; Ventura Capell, Enric (2016-10-25)
    Article
    Accés restringit per política de l'editorial
    We prove that one cannot algorithmically decide whether a finitely presented Z-extension admits a finitely generated base group, and we use this fact to prove the undecidability of the BNS invariant. Furthermore, we show ...
  • Put three and three together: Triangle-driven community detection 

    Prat Pérez, Arnau; Domínguez Sal, David; Brunat Blay, Josep Maria; Larriba Pey, Josep (Association for Computing Machinery (ACM), 2016-02-01)
    Article
    Accés obert
    Community detection has arisen as one of the most relevant topics in the field of graph data mining due to its applications in many fields such as biology, social networks, or network traffic analysis. Although the existing ...
  • Polygons as sections of higher-dimensional polytopes 

    Padrol Sureda, Arnau; Pfeifle, Julián (2015-02-09)
    Article
    Accés obert
    We show that every heptagon is a section of a 3-polytope with 6 vertices. This implies that every n-gon with n >= 7 can be obtained as a section of a (2 + [n/7])-dimensional polytope with at most [6n/7] vertices; and ...
  • Lower bounds on the maximum number of non-crossing acyclic graphs 

    Huemer, Clemens; Mier Vinué, Anna de (2015-08-01)
    Article
    Accés restringit per política de l'editorial
    This paper is a contribution to the problem of counting geometric graphs on point sets. More concretely, we look at the maximum numbers of non-crossing spanning trees and forests. We show that the so-called double chain ...

Mostra'n més