Výsledky vyhledávání - "05 Combinatorics::05E Algebraic combinatorics [Classificació AMS]"

En aquest treball s'introdueixen les principals nocions de teoria de matroides, matroides transversals i extensions d'un sol element. El nostre primer objectiu és estudiar quines extensions d'una matroide transversal són també transversals. En par

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od______3484::4e5dae7b277468b4e1b650eac9fad2ef
https://hdl.handle.net/2117/388663

Zobrazit plný text záznamu

Maximum Box Problem on Stochastic Points

Autor: Inmaculada Ventura, Carlos Seara, Pablo Pérez-Lantero, Luis Evaristo Caraballo

Publikováno v: Algorithmica
LATIN 2018: Theoretical Informatics
idUS. Depósito de Investigación de la Universidad de Sevilla
instname
Lecture Notes in Computer Science
Lecture Notes in Computer Science-LATIN 2018: Theoretical Informatics
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
LATIN 2018: Theoretical Informatics ISBN: 9783319774039
LATIN

Given a finite set of weighted points in $${\mathbb {R}}^d$$ R d (where there can be negative weights), the maximum box problem asks for an axis-aligned rectangle (i.e., box) such that the sum of the weights of the points that it contains is maximize

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9774e852c16dd1909c06f3451d1cebdc

Zobrazit plný text záznamu

Improving bounds on the order of regular graphs of girth 5

Autor: Camino Balbuena, Manuel Bendala, X. Marcote, Encarnación Abajo

Publikováno v: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)

A ( k , g ) -graph is a k -regular graph with girth g and a ( k , g ) -cage is a ( k , g ) -graph with the fewest possible number of vertices n ( k , g ) . Constructing ( k , g ) -cages and determining the order are both very hard problems. For this

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a3851dece9908f530e0d55cb9dc2e8e2
https://doi.org/10.1016/j.disc.2019.02.007

Zobrazit plný text záznamu

Some Results on the Laplacian Spectra of Token Graphs

Autor: Francisco Javier Zaragoza Martínez, Frank Duque, Clemens Huemer, Cristina Dalfó, Ruy Fabila-Monroy, Ana Laura Trujillo-Negrete, Miquel Àngel Fiol

Publikováno v: Extended Abstracts EuroComb 2021. European Conference on Combinatorics, Graph Theory and Applications. Trends in Mathematics book series (RPCRMB,volume 14)
Trends in Mathematics
Trends in Mathematics-Extended Abstracts EuroComb 2021
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Trends in Mathematics ISBN: 9783030838225

This version of the contribution has been accepted for publication, after peer review but is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at: http://dx.doi.

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5ccdde2d91018d96defd2e65d3b343de

Zobrazit plný text záznamu

Quasirandomness in discrete mathematics, additive combinatorics and group theory

Autor: Hernández Ramos, Adrián

Publikováno v: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)

The main objective of this bachelor's thesis will be to present the concept of quasirandomness in various mathematical contexts while proving all the pertinent results. We will introduce the results of Fan Chung and Ronald Graham on quasirandom graph

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::41f5dedd8b73d2c93bd0f948f3cbfd7b
https://hdl.handle.net/2117/327863

Zobrazit plný text záznamu

A general method to obtain the spectrum and local spectra of a graph from its regular partitions

Autor: C. Dalfó, Miguel Angel Fiol

Publikováno v: Repositorio Abierto de la UdL
Universitad de Lleida
Recercat. Dipósit de la Recerca de Catalunya
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Linear Algebra and its Applications
Recercat: Dipósit de la Recerca de Catalunya
Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)

It is well known that, in general, part of the spectrum of a graph can be obtained from the adjacency matrix of its quotient graph given by a regular partition. In this paper, a method that gives all the spectrum, and also the local spectra, of a gra

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::78513a231380d4aafbf958f2c0777882
http://hdl.handle.net/10459.1/70126

Zobrazit plný text záznamu

Set systems with distinct sumsets

Autor: Oriol Serra, Maximilian Wötzel, Javier Cilleruelo

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

A family A of k-subsets of { 1 , 2 , … , N } is a Sidon system if the sumsets A + A ′ , A , A ′ ∈ A are pairwise distinct. We show that the largest cardinality F k ( N ) of a Sidon system of k-subsets of [ N ] satisfies F k ( N ) ≤ ( N −

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c665ed747485cb566539d1a475c9f179
https://doi.org/10.1016/j.endm.2018.06.004

Zobrazit plný text záznamu

Matroids, positroids and paths

Autor: Ros Jiménez, Zaira

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

Matroids arise from the abstract notion of dependency. Matroids can be studied from different points of view. From linear algebra we know matrices, which can be seen as matroids, however matroids generalise the concept of dependency. In matroids ther

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::7f045c57abee5d5b365f0bb90c778d08
https://hdl.handle.net/2117/168363

Zobrazit plný text záznamu

Introducción al lenguaje algebraico en un entorno de resolución de problemas

Autor: López Beltrán, Mireia

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

La resolución de problemas y las tareas ricas nos brindan una magnífica oportunidad para la introducción y adquisición del lenguaje algebraico. En este trabajo presentamos una selección de actividades recogida en el blog Banco de recursos del FE

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::9b6ff3e71b2599f4c4d1ab187b0d2e7d
https://hdl.handle.net/2117/126940

Zobrazit plný text záznamu

A branch-and-price algorithm for the Aperiodic Multi-Period Service Scheduling Problem

Autor: Elena Fernández, Cristina Nunez-del-Toro, Joerg Kalcsics

Publikováno v: Fernandez, E, Kalcsics, J & Nunez-del-Toro, C 2017, ' A branch-and-price algorithm for the aperiodic multi-period service scheduling problem ', European Journal of Operational Research, vol. 263, no. 3, pp. 805-814 . https://doi.org/10.1016/j.ejor.2017.06.008
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname

This paper considers the multi-period service scheduling problem with an aperiodic service policy. In this problem, a set of customers who periodically require service over a finite time horizon is given. To satisfy the service demands, a set of oper

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5374ed0b18fc5f3463af2675b2f3c2dc
https://hdl.handle.net/2117/114681

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání