Search Results - "Brunat, Josep M."

  • Showing 1 - 16 results of 16
Refine Results
  1. 1

    Satins, lattices, and extended Euclid's algorithm by Brunat, Josep M., Lario, Joan-C.

    “…Motivated by the design of satins with draft of period m and step  a , we draw our attention to the lattices L ( m , a ) = ⟨ ( 1 , a ) , ( 0 , m ) ⟩ where 1 ≤…”
    Get full text
    Journal Article
  2. 2

    Extreme Weights in Steinhaus Triangles by Brunat, Josep M., Maureso, Montserrat

    Published in Electronic notes in discrete mathematics (01-10-2016)
    “…Let {0=w0<w1<w2<…<wm} be the set of weights of binary Steinhaus triangles of size n, and let Wi be the set of sequences in F2n that generate triangles of…”
    Get full text
    Journal Article Publication
  3. 3

    On polynomial digraphs by Brunat, Josep M., Montes, Antonio

    Published in Discrete mathematics (06-03-2006)
    “…Let Φ ( x , y ) be a bivariate polynomial with complex coefficients. The zeroes of Φ ( x , y ) are given a combinatorial structure by considering them as arcs…”
    Get full text
    Journal Article
  4. 4

    On endo-Cayley digraphs: The hamiltonian property by Maureso, Montserrat, Brunat, Josep M.

    Published in Discrete mathematics (28-08-2005)
    “…Given a finite abelian group A, a subset Δ ⊆ A and an endomorphism φ of A, the endo-Cayley digraph G A ( φ , Δ ) is defined by taking A as the vertex set and…”
    Get full text
    Journal Article
  5. 5

    Chromatic Automorphisms of Consecutive Digraphs by Brunat, Josep M., Fiol, Miguel A., Maureso, Montserrat

    Published in Graphs and combinatorics (01-06-2003)
    “…Let 1 less than or equal to d less than or equal to n be two positive integers, e,h,c belongs to Zn, and assume that the set delta={e,e+h,...,e+(d-1)h} subset…”
    Get full text
    Journal Article
  6. 6

    Computing the Canonical Representation of Constructible Sets by Brunat, Josep M., Montes, Antonio

    Published in Mathematics in computer science (01-03-2016)
    “…Constructible sets are needed in many algorithms of Computer Algebra, particularly in the Gröbner Cover and other algorithms for parametric polynomial systems…”
    Get full text
    Journal Article Publication
  7. 7

    Periodicity of power Fibonacci sequences modulus a Fibonacci number by Brunat, Josep M, Lario, Joan-C

    Published 01-04-2022
    “…Let ${\mathcal F}=(F_i:i\ge 0)$ be the sequence of Fibonacci numbers, and $j$ and $e$ be non negative integers. We study the periodicity of the power Fibonacci…”
    Get full text
    Journal Article
  8. 8

    A polynomial generalization of the power-compositions determinant by Brunat, Josep M., Montes, Antonio

    Published in Linear & multilinear algebra (01-07-2007)
    “…Let C(n, p) be the set of p-compositions of an integer n, i.e., the set of p-tuples α=(α 1 ,... ,α p ) of nonnegative integers such that α 1 +··· +α p =n, and…”
    Get full text
    Journal Article
  9. 9

    A problem on concatenated integers by Brunat, Josep M, Lario, Joan-Carles

    Published 09-03-2021
    “…Motivated by a WhattsApp message, we find out the integers $x> y\ge 1$ such that $(x+1)/(y+1)=(x\circ(y+1))/(y\circ (x+1))$, where $\circ$ means the…”
    Get full text
    Journal Article
  10. 10

    Partitions of a finite Boolean lattice into intervals by Brunat, Josep M., Guedes de Oliveira, António, Noy, Marc

    Published in European journal of combinatorics (01-11-2009)
    “…Related to activities in matroids, J.E. Dawson introduced a construction that leads to partitions of the Boolean lattice of parts of a set into intervals. In…”
    Get full text
    Journal Article
  11. 11

    Steinhaus Triangles Generated by Vectors of the Canonical Bases by Brunat, Josep M, Maureso, Montserrat

    Published 21-07-2017
    “…We give a method to calculate the weight of binary Steinhaus triangles generated by the vectors of the canonical basis of the vector space $\mathbb{F}_2^n$…”
    Get full text
    Journal Article
  12. 12

    Small and Large Weights in Steinhaus Triangles by Brunat, Josep M, Maureso, Montserrat

    Published 19-07-2017
    “…Let $\{0=w_0<w_1<w_2<\ldots<w_m\}$ be the set of weights of binary Steinhaus triangles of size $n$, and let $W_i$ be the set of sequences in $\mathbb{F}_2^n$…”
    Get full text
    Journal Article
  13. 13

    A polynomial generalization of the power-compositions determinant by Brunat, Josep M, Montes, Antonio

    Published 31-01-2006
    “…Let $C(n,p)$ be the set of $p$-compositions of an integer $n$, i.e., the set of $p$-tuples $\bm{\alpha}=(\alpha_1,...,\alpha_p)$ of nonnegative integers such…”
    Get full text
    Journal Article
  14. 14

    The characteristic ideal of a finite, connected, regular graph by Brunat, Josep M, Montes, Antonio

    Published 30-01-2006
    “…Proc. ISSAC-2004, ACM, 50-57 Let $\Phi(x,y)\in\mathbb{C}[x,y]$ be a symmetric polynomial of partial degree $d$. The graph $G(\Phi)$ is defined by taking…”
    Get full text
    Journal Article
  15. 15

    On polynomial digraphs by Brunat, Josep M, Montes, Antonio

    Published 30-01-2006
    “…Discrete Math. (2006), 306/4, p 401-412 Let $\Phi(x,y)$ be a bivariate polynomial with complex coefficients. The zeroes of $\Phi(x,y)$ are given a…”
    Get full text
    Journal Article
  16. 16

    Shaping Communities out of Triangles by Prat-Pérez, Arnau, Dominguez-Sal, David, Brunat, Josep M, Larriba-Pey, Josep-Lluis

    Published 26-07-2012
    “…Community detection has arisen as one of the most relevant topics in the field of graph data mining due to its importance in many fields such as biology,…”
    Get full text
    Journal Article