Zobrazeno 1 - 10
of 13
pro vyhledávání: '"05 Combinatorics::05B Designs and configurations [Classificació AMS]"'
We prove that the ribbon graph polynomial of a graph embedded in an orientable surface is irreducible if and only if the embedded graph is neither the disjoint union nor the join of embedded graphs. This result is analogous to the fact that the Tutte
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0f5e24c9d91301dbb8c2d736b20b60c5
http://arxiv.org/abs/2212.10920
http://arxiv.org/abs/2212.10920
Autor:
Maximilian Wötzel, Juanjo Rué
Publikováno v:
Gonzalez Herrera, A. (ed.), Discrete Mathematics Days 2022: Santander, Spain, July 4-6,2022, pp. 243-245
Linear Algebra and Its Applications, 649, 122-151
Linear Algebra and Its Applications, 649, pp. 122-151
Linear Algebra and Its Applications, 649, 122-151
Linear Algebra and Its Applications, 649, pp. 122-151
We consider the binomial random set model $[n]_p$ where each element in $\{1,\dots,n\}$ is chosen independently with probability $p:=p(n)$. We show that for essentially all regimes of $p$ and very general conditions for a matrix $A$ and a column vect
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9708a6efbab35f8adfbdbd6c810bcfc7
https://hdl.handle.net/2117/385698
https://hdl.handle.net/2117/385698
Publikováno v:
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Universitat Politècnica de Catalunya (UPC)
Freiman's 2.4-Theorem states that any set $A \subset \mathbb{Z}_p$ satisfying $|2A| \leq 2.4|A| - 3 $ and $|A| < p/35$ can be covered by an arithmetic progression of length at most $|2A| - |A| + 1$. A more general result of Green and Ruzsa implies th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::db77703f04934be9f7a82408f018d164
https://hdl.handle.net/2117/343738
https://hdl.handle.net/2117/343738
Autor:
Olga Castañer Nino, Rafael de la Torre, Ester Civit, Jose Rodríguez-Morató, Albert Goday Arno, José M. Ramón, Luis Grande, David Benaiges Boix, Manuel Pera, Marcel·li Carbó, Esther Papaseit, Klaus Langohr, Magí Farré, Clara Pérez-Mañá, Juana A. Flores-Le Roux
Publikováno v:
Obesity Surgery
r-IGTP. Repositorio Institucional de Producción Científica del Instituto de Investigación Germans Trias i Pujol
instname
Recercat. Dipósit de la Recerca de Catalunya
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
r-IGTP. Repositorio Institucional de Producción Científica del Instituto de Investigación Germans Trias i Pujol
instname
Recercat. Dipósit de la Recerca de Catalunya
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
PURPOSE: The purpose of the study was to study the impact of the two most common bariatric surgery techniques on paracetamol pharmacokinetics (a marker of gastric emptying) and caffeine metabolism (a marker of liver function). MATERIALS AND METHODS:
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c2c8f62ed5bf263f8b6dd384931047e0
https://fundanet.igtp.cat/Publicaciones/ProdCientif/PublicacionFrw.aspx?id=6261
https://fundanet.igtp.cat/Publicaciones/ProdCientif/PublicacionFrw.aspx?id=6261
Autor:
Vera Sacristán, Birgit Vogtenhuber, Alexander Pilz, Pedro Ramos, Oswin Aichholzer, Thomas Hackl
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
Universitat Jaume I
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
Universitat Jaume I
A good drawing of a simple graph is a drawing on the sphere or, equivalently, in the plane in which vertices are drawn as distinct points, edges are drawn as Jordan arcs connecting their end vertices, and any pair of edges intersects at most once. In
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d6a009338880d5dd40240ff36e206f41
https://hdl.handle.net/2117/78142
https://hdl.handle.net/2117/78142
Autor:
Carles Padró, Oriol Farràs
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
One important result in secret sharing is the Brickell-Davenport Theorem: every ideal perfect secret sharing scheme de nes a matroid that is uniquely determined by the access structure. Even though a few attempts have been made, there is no satisfact
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fcc2ca4b3c9206a1f57065eef3f4b97f
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
The problem of district design for the implementation of arc routing activities is addressed. The aim is to partition a road network into a given number of sectors to facilitate the organization of the operations to be implemented within the region.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::07337a55e70ab39c7741437307f3082d
Autor:
Josep M. Brunat, Montserrat Maureso
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
We give explicit formulae for obtaining the binary sequences which produce Steinhaus triangles and generalized Pascal triangles with rotational and dihedral symmetries.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9710011415f5f4968a7bfc3304749d83
https://hdl.handle.net/2117/11871
https://hdl.handle.net/2117/11871
Autor:
Bras Amorós, Maria, Stokes, Klara
Publikováno v:
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Universitat Politècnica de Catalunya (UPC)
A (v, b, r, k) combinatorial configuration can be defined as a connected, (r, k)-biregular bipartite graph with v vertices on one side and b vertices on the other and with no cycle of length 4. Combinatorial configurations have become very important
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::e8f2862b39706f742cc3d3570cc1ffec
https://hdl.handle.net/2099/10372
https://hdl.handle.net/2099/10372
Autor:
Carles Padró, Jaume Martí-Farré
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
Journal of Mathematical Cryptology, Vol 4, Iss 2, Pp 95-120 (2010)
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname
Journal of Mathematical Cryptology, Vol 4, Iss 2, Pp 95-120 (2010)
The complexity of a secret sharing scheme is defined as the ratio between the maximum length of the shares and the length of the secret. The optimization of this parameter for general access structures is an important and very difficult open problem
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::594c7ee278604eb2d31d5d9494045643
https://hdl.handle.net/2117/11444
https://hdl.handle.net/2117/11444