Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Josep M. Brunat"'
Autor:
Josep M. Brunat, Joan-C. Lario
Publikováno v:
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Universitat Politècnica de Catalunya (UPC)
Motivated by the design of satins with draft of period m and step a, we draw our attention to the lattices $$L(m,a)=\langle (1,a),(0,m)\rangle$$ L ( m , a ) = ⟨ ( 1 , a ) , ( 0 , m ) ⟩ where $$1\le a 1 ≤ a < m are integers with $$\gcd (m,a)=1$$
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::aae3491c8aa60544e538039092a923dc
https://hdl.handle.net/2117/365868
https://hdl.handle.net/2117/365868
Autor:
Josep M. Brunat, Montserrat Maureso
Publikováno v:
Recercat. Dipósit de la Recerca de Catalunya
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Let { 0 = w 0 w 1 w 2 … w m } be the set of weights of binary Steinhaus triangles of size n, and let W i be the set of sequences in F 2 n that generate triangles of weight wi. In this paper we obtain the values of w i and the corresponding sets W i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::518d762602b063f37f0bf43a913d8b06
https://doi.org/10.1016/j.endm.2016.09.060
https://doi.org/10.1016/j.endm.2016.09.060
Autor:
Josep M. Brunat, Antonio Montes
Publikováno v:
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname
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 and give algorithms for co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8ee7e75c119a44064dca1e3e0e0ed1d8
http://hdl.handle.net/2117/100350
http://hdl.handle.net/2117/100350
Publikováno v:
European Journal of Combinatorics. 30(8):1801-1809
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 this paper we characterize explicitly the partitions of a Boolean lattice into intervals tha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9fdc026975a1f1ce0340d4300e567766
Autor:
Josep M. Brunat, Montserrat Maureso
Publikováno v:
Discrete Mathematics. 299:194-207
Given a finite abelian group A, a subset @[email protected]?A and an endomorphism @f of A, the endo-Cayley digraph G"A(@f,@D) is defined by taking A as the vertex set and making every vertex x adjacent to the vertices @f(x)+a with [email protected][e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0c379cfffa45f110b69401fd465a336f
https://doi.org/10.1016/j.disc.2004.05.020
https://doi.org/10.1016/j.disc.2004.05.020
Publikováno v:
Scopus-Elsevier
Let 1≤d≤n be two positive integers, e,h,c∈ℤ n , and assume that the set Δ={e,e+h,…,e+(d−1)h}⊆ℤ n has cardinality d. A consecutive digraph Γ is defined by taking ℤ n as the set of vertices and the pairs (x,cx+a), with a∈Δ, as ar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9b4731f99824a753196f4803a67502ec
https://doi.org/10.1007/s00373-002-0500-1
https://doi.org/10.1007/s00373-002-0500-1
Autor:
Antonio Montes, Josep M. Brunat
Publikováno v:
SIAM Journal on Matrix Analysis and Applications. 23:459-471
Let C(n,p) be the set of p-compositions of an integer n, i.e., the set of p-tuples $\alpha=(\alpha_1,\ldots,\alpha_p)$ of nonnegative integers such that $\alpha_1+\cdots+\alpha_p=n$. The main result of this paper is an explicit formula for the determ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::74233a58c1301ee1e1e7c3d2ff98dc5e
https://doi.org/10.1137/s0895479800369141
https://doi.org/10.1137/s0895479800369141
Publikováno v:
Scopus-Elsevier
Given a finite abelian group A , a subset δ ⊂ A and an endomorphism φ of A , the endo-circulant digraph G A ( φ , δ ) is defined by taking A as vertex set and every vertex x adjacent to the vertices of the form φ ( x ) + a with a ∈ δ . In t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::36be76516b239d284e9f5f0e4e4a97af
Autor:
Josep M. Brunat, Joan-C. Lario
Publikováno v:
Journal of Algebraic Combinatorics. 10:135-148
Given a symmetric polynomial Φ(x, y) over a perfect field k of characteristic zero, the Galois graph G(Φ) is defined by taking the algebraic closure as the vertex set and adjacencies corresponding to the zeroes of Φ(x, y). Some graph properties of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3128a55cf5b0fb1ca7a742b91d80d9b2
https://doi.org/10.1023/a:1018723511986
https://doi.org/10.1023/a:1018723511986
Publikováno v:
Scopus-Elsevier
A c-circulant digraph GN(c, Δ) has ZN as its vertex set and adjacency rules given by x → cx + a with α ϵ Δ ⋐ Z N . The c-circulant digraphs of degree two which are isomorphic to some circulant digraph are characterized, and the corresponding
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ceed454d97b88bab6129f0e52d275ac4