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

  • 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 ...
  • Finite automata for Schreier graphs of virtually free groups 

    Silva, Pedro V.; Soler Escrivà, Xaro; Ventura Capell, Enric (2016-01-01)
    Article
    Accés obert
    The Stallings construction for f.g. subgroups of free groups is generalized by introducing the concept of Stallings section, which allows efficient computation of the core of a Schreier graph based on edge folding. It is ...
  • On the probability of planarity of a random graph near the critical point 

    Noy Serrano, Marcos; Ravelomanana, Vlady; Rue, Juanjo (2015-03-01)
    Article
    Accés obert
    Let G(n, M) be the uniform random graph with n vertices and M edges. Erdos and Renyi (1960) conjectured that the limiting probability; lim(n ->infinity) Pr{G(n, n/2) is planar}; exists and is a constant strictly between 0 ...
  • The conjugacy problem for free-by-cyclic groups 

    Martino, Armando; Ventura Capell, Enric (2004-04)
    Report de recerca
    Accés obert
    We show that the conjugacy problem is solvable in [finitely generated free]-by-cyclic groups, by using a result of O. Maslakova that one can algorithmically find generating sets for the fixed sub- groups of free group ...
  • The automorphism group of a free-by-cyclic group in rank 2 

    Bogopolski, Oleg; Martino, Armando; Ventura Capell, Enric (2007-05)
    Article
    Accés obert
    Let ¡ be an automorphism of a free group F 2 of rank 2 and let M ¡ = F 2 o ¡ Z be the corresponding mapping torus of ¡ . We prove that the group Out ( M ¡ ) is usually virtually cyclic. More- over, ...

Mostra'n més