Reports de recerca
http://hdl.handle.net/2117/3919
Fri, 21 Jul 2017 08:55:59 GMT2017-07-21T08:55:59ZGeometric quantization of semitoric systems and almost toric manifolds
http://hdl.handle.net/2117/106532
Geometric quantization of semitoric systems and almost toric manifolds
Miranda Galcerán, Eva; Presas, Francisco; Solha, Romero
Kostant gave a model for the real geometric quantization
associated to polarizations via the cohomology associated to the sheaf of
flat sections of a pre-quantum line bundle. This model is well-adapted
for real polarizations given by integrable systems and toric manifolds.
In the latter case, the cohomology can be computed counting integral
points inside the associated Delzant polytope. In this article we extend
Kostant’s geometric quantization to semitoric integrable systems and
almost toric manifolds. In these cases the dimension of the acting torus
is smaller than half of the dimension of the manifold. In particular, we
compute the cohomology groups associated to the geometric quantization
if the real polarization is the one associated to an integrable system
with focus-focus type singularities in dimension four. As application
we determine models for the geometric quantization of K3 surfaces, a
spin-spin system, the spherical pendulum, and a spin-oscillator system
under this scheme.
Mon, 17 Jul 2017 10:56:24 GMThttp://hdl.handle.net/2117/1065322017-07-17T10:56:24ZMiranda Galcerán, EvaPresas, FranciscoSolha, RomeroKostant gave a model for the real geometric quantization
associated to polarizations via the cohomology associated to the sheaf of
flat sections of a pre-quantum line bundle. This model is well-adapted
for real polarizations given by integrable systems and toric manifolds.
In the latter case, the cohomology can be computed counting integral
points inside the associated Delzant polytope. In this article we extend
Kostant’s geometric quantization to semitoric integrable systems and
almost toric manifolds. In these cases the dimension of the acting torus
is smaller than half of the dimension of the manifold. In particular, we
compute the cohomology groups associated to the geometric quantization
if the real polarization is the one associated to an integrable system
with focus-focus type singularities in dimension four. As application
we determine models for the geometric quantization of K3 surfaces, a
spin-spin system, the spherical pendulum, and a spin-oscillator system
under this scheme.An invitation to singular symplectic geometry
http://hdl.handle.net/2117/106301
An invitation to singular symplectic geometry
Miranda Galcerán, Eva; Delshams Valdés, Amadeu; Planas Bahí, Arnau; Oms, Cedric; Dempsey Bradell, Roisin Mary
In this paper we analyze in detail a collection of motivating examples to consider bm-
symplectic forms and folded-type symplectic structures. In particular, we provide models in
Celestial Mechanics for every bm-symplectic structure. At the end of the paper, we introduce
the odd-dimensional analogue to b-symplectic manifolds: b-contact manifolds.
Mon, 10 Jul 2017 09:18:33 GMThttp://hdl.handle.net/2117/1063012017-07-10T09:18:33ZMiranda Galcerán, EvaDelshams Valdés, AmadeuPlanas Bahí, ArnauOms, CedricDempsey Bradell, Roisin MaryIn this paper we analyze in detail a collection of motivating examples to consider bm-
symplectic forms and folded-type symplectic structures. In particular, we provide models in
Celestial Mechanics for every bm-symplectic structure. At the end of the paper, we introduce
the odd-dimensional analogue to b-symplectic manifolds: b-contact manifolds.From subKautz digraphs to cyclic Kautz digraphs
http://hdl.handle.net/2117/105173
From subKautz digraphs to cyclic Kautz digraphs
Dalfó Simó, Cristina
Kautz digraphs K(d,l) are a well-known family of dense digraphs, widely studied as a good model for interconnection networks. Closely related with these, the cyclic Kautz digraphs CK(d,l) were recently introduced by Böhmová, Huemer and the author, and some of its distance-related parameters were fixed. In this paper we propose a new approach to cyclic Kautz digraphs by introducing the family of subKautz digraphs sK(d,l), from where the cyclic Kautz digraphs can be obtained as line digraphs. This allows us to give exact formulas for the distance between any two vertices of both sK(d,l) and CK(d,l). Moreover, we compute the diameter and the semigirth of both families, also providing efficient routing algorithms to find the shortest path between any pair of vertices. Using these parameters, we also prove that sK(d,l) and CK(d,l) are maximally vertex-connected and super-edge-connected. Whereas K(d,l) are optimal with respect to the diameter, we show that sK(d,l) and CK(d,l) are optimal with respect to the mean distance, whose exact values are given for both families when l = 3. Finally, we provide a lower bound on the girth of CK(d,l) and sK(d,l)
Tue, 06 Jun 2017 12:12:17 GMThttp://hdl.handle.net/2117/1051732017-06-06T12:12:17ZDalfó Simó, CristinaKautz digraphs K(d,l) are a well-known family of dense digraphs, widely studied as a good model for interconnection networks. Closely related with these, the cyclic Kautz digraphs CK(d,l) were recently introduced by Böhmová, Huemer and the author, and some of its distance-related parameters were fixed. In this paper we propose a new approach to cyclic Kautz digraphs by introducing the family of subKautz digraphs sK(d,l), from where the cyclic Kautz digraphs can be obtained as line digraphs. This allows us to give exact formulas for the distance between any two vertices of both sK(d,l) and CK(d,l). Moreover, we compute the diameter and the semigirth of both families, also providing efficient routing algorithms to find the shortest path between any pair of vertices. Using these parameters, we also prove that sK(d,l) and CK(d,l) are maximally vertex-connected and super-edge-connected. Whereas K(d,l) are optimal with respect to the diameter, we show that sK(d,l) and CK(d,l) are optimal with respect to the mean distance, whose exact values are given for both families when l = 3. Finally, we provide a lower bound on the girth of CK(d,l) and sK(d,l)On quotient digraphs and voltage digraphs
http://hdl.handle.net/2117/105171
On quotient digraphs and voltage digraphs
Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel; Miller, Mirka; Ryan, Joe
In this note we present a general approach to construct large digraphs from small ones. These are called expanded digraphs, and, as particular cases, we show their close relationship between voltage digraphs and line digraphs, which are two known approaches to obtain dense digraphs. In the same context, we show the equivalence
between the vertex-splitting and partial line digraph techniques. Then, we give a sufficient condition for a lifted digraph of a base line digraph to be again a line digraph. Some of the results are illustrated with two well-known families of digraphs. Namely, De Bruijn and Kautz digraphs.
Tue, 06 Jun 2017 12:00:49 GMThttp://hdl.handle.net/2117/1051712017-06-06T12:00:49ZDalfó Simó, CristinaFiol Mora, Miquel ÀngelMiller, MirkaRyan, JoeIn this note we present a general approach to construct large digraphs from small ones. These are called expanded digraphs, and, as particular cases, we show their close relationship between voltage digraphs and line digraphs, which are two known approaches to obtain dense digraphs. In the same context, we show the equivalence
between the vertex-splitting and partial line digraph techniques. Then, we give a sufficient condition for a lifted digraph of a base line digraph to be again a line digraph. Some of the results are illustrated with two well-known families of digraphs. Namely, De Bruijn and Kautz digraphs.On alpha-roughly weighted games
http://hdl.handle.net/2117/103235
On alpha-roughly weighted games
Freixas Bosch, Josep; Kurz, Sascha
Very recently Gvozdeva, Hemaspaandra, and Slinko (2011) h
ave introduced three hierarchies for simple games in order to measure the distance of a given simple game to the class of weighted voting games or roughly weighted voting games. Their third class C aconsists of all simple games
permitting a weighted representation such that each winnin
g coalition has a weight of at least 1 and each losing coalition a weight of at most a. We continue their work and contribute some new results on the possible values of a for a given number of voters.
Mon, 03 Apr 2017 15:53:36 GMThttp://hdl.handle.net/2117/1032352017-04-03T15:53:36ZFreixas Bosch, JosepKurz, SaschaVery recently Gvozdeva, Hemaspaandra, and Slinko (2011) h
ave introduced three hierarchies for simple games in order to measure the distance of a given simple game to the class of weighted voting games or roughly weighted voting games. Their third class C aconsists of all simple games
permitting a weighted representation such that each winnin
g coalition has a weight of at least 1 and each losing coalition a weight of at most a. We continue their work and contribute some new results on the possible values of a for a given number of voters.The complexity of testing properties of simple games
http://hdl.handle.net/2117/103171
The complexity of testing properties of simple games
Freixas Bosch, Josep; Molinero Albareda, Xavier; Olsen, Martin; Serna Iglesias, María José
Simple games cover voting systems in which a single alternative, such as a bill or an amendment, is pitted against the status quo. A simple game or a yes-no voting system is a set of rules that specifies exactly which collections of ``yea'' votes yield passage of the issue at hand. A collection of ``yea'' voters forms a winning coalition.
We are interested on performing a complexity analysis of problems on such games depending on the game representation. We consider four natural explicit representations, winning, loosing, minimal winning, and maximal loosing. We first analyze the computational complexity of obtaining a particular representation of a simple game from a different one. We show that some cases this transformation can be done in polynomial time while the others require exponential time. The second question is classifying the complexity for testing whether a game is simple or weighted. We show that for the four types of representation both problem can be solved in polynomial time. Finally, we provide results on the complexity of testing whether a simple game or a weighted game is of a special type. In this way, we analyze strongness, properness, decisiveness and homogeneity, which are desirable properties to be fulfilled for a simple game.
Fri, 31 Mar 2017 15:48:07 GMThttp://hdl.handle.net/2117/1031712017-03-31T15:48:07ZFreixas Bosch, JosepMolinero Albareda, XavierOlsen, MartinSerna Iglesias, María JoséSimple games cover voting systems in which a single alternative, such as a bill or an amendment, is pitted against the status quo. A simple game or a yes-no voting system is a set of rules that specifies exactly which collections of ``yea'' votes yield passage of the issue at hand. A collection of ``yea'' voters forms a winning coalition.
We are interested on performing a complexity analysis of problems on such games depending on the game representation. We consider four natural explicit representations, winning, loosing, minimal winning, and maximal loosing. We first analyze the computational complexity of obtaining a particular representation of a simple game from a different one. We show that some cases this transformation can be done in polynomial time while the others require exponential time. The second question is classifying the complexity for testing whether a game is simple or weighted. We show that for the four types of representation both problem can be solved in polynomial time. Finally, we provide results on the complexity of testing whether a simple game or a weighted game is of a special type. In this way, we analyze strongness, properness, decisiveness and homogeneity, which are desirable properties to be fulfilled for a simple game.Report on the EGNSS competition after Y1
http://hdl.handle.net/2117/102717
Report on the EGNSS competition after Y1
Sanz Subirana, Jaume; Juan Zornoza, José Miguel; Alonso Alonso, María Teresa
Tue, 21 Mar 2017 10:30:26 GMThttp://hdl.handle.net/2117/1027172017-03-21T10:30:26ZSanz Subirana, JaumeJuan Zornoza, José MiguelAlonso Alonso, María TeresaDecomposition spaces in combinatorics
http://hdl.handle.net/2117/102202
Decomposition spaces in combinatorics
Gálvez Carrillo, Maria Immaculada; Kock, Joachim; Tonks, Andrew
A decomposition space (also called unital 2-Segal space) is a simplicial object satisfying an exactness condition weaker than the Segal condition: just as the Segal condition expresses (up to homotopy) composition, the new condition expresses decomposition. It is a general framework for incidence (co)algebras. In the present contribution, after establishing a formula for the section coefficients, we survey a large supply of examples, emphasising the notion's firm roots in classical combinatorics. The first batch of examples, similar to binomial posets, serves to illustrate two key points: (1) the incidence algebra in question is realised directly from a decomposition space, without a reduction step, and reductions are often given by CULF functors; (2) at the objective level, the convolution algebra is a monoidal structure of species. Specifically, we encounter the usual Cauchy product of species, the shuffle product of L-species, the Dirichlet product of arithmetic species, the Joyal-Street external product of q-species and the Morrison `Cauchy' product of q-species, and in each case a power series representation results from taking cardinality. The external product of q-species exemplifies the fact that Waldhausen's S-construction on an abelian category is a decomposition space, yielding Hall algebras. The next class of examples includes Schmitt's chromatic Hopf algebra, the Fa\`a di Bruno bialgebra, the Butcher-Connes-Kreimer Hopf algebra of trees and several variations from operad theory. Similar structures on posets and directed graphs exemplify a general construction of decomposition spaces from directed restriction species. We finish by computing the M\
Thu, 09 Mar 2017 13:10:06 GMThttp://hdl.handle.net/2117/1022022017-03-09T13:10:06ZGálvez Carrillo, Maria ImmaculadaKock, JoachimTonks, AndrewA decomposition space (also called unital 2-Segal space) is a simplicial object satisfying an exactness condition weaker than the Segal condition: just as the Segal condition expresses (up to homotopy) composition, the new condition expresses decomposition. It is a general framework for incidence (co)algebras. In the present contribution, after establishing a formula for the section coefficients, we survey a large supply of examples, emphasising the notion's firm roots in classical combinatorics. The first batch of examples, similar to binomial posets, serves to illustrate two key points: (1) the incidence algebra in question is realised directly from a decomposition space, without a reduction step, and reductions are often given by CULF functors; (2) at the objective level, the convolution algebra is a monoidal structure of species. Specifically, we encounter the usual Cauchy product of species, the shuffle product of L-species, the Dirichlet product of arithmetic species, the Joyal-Street external product of q-species and the Morrison `Cauchy' product of q-species, and in each case a power series representation results from taking cardinality. The external product of q-species exemplifies the fact that Waldhausen's S-construction on an abelian category is a decomposition space, yielding Hall algebras. The next class of examples includes Schmitt's chromatic Hopf algebra, the Fa\`a di Bruno bialgebra, the Butcher-Connes-Kreimer Hopf algebra of trees and several variations from operad theory. Similar structures on posets and directed graphs exemplify a general construction of decomposition spaces from directed restriction species. We finish by computing the M\Three Hopf algebras and their common simplicial and categorical background
http://hdl.handle.net/2117/102199
Three Hopf algebras and their common simplicial and categorical background
Gálvez Carrillo, Maria Immaculada; Kaufmann, Ralph L.; Tonks, Andrew
We consider three a priori totally different setups for Hopf algebras from number theory, mathematical physics and algebraic topology. These are the Hopf algebras of Goncharov for multiple zeta values, that of Connes--Kreimer for renormalization, and a Hopf algebra constructed by Baues to study double loop spaces. We show that these examples can be successively unified by considering simplicial objects, cooperads with multiplication and Feynman categories at the ultimate level. These considerations open the door to new constructions and reinterpretation of known constructions in a large common framework
Thu, 09 Mar 2017 12:51:30 GMThttp://hdl.handle.net/2117/1021992017-03-09T12:51:30ZGálvez Carrillo, Maria ImmaculadaKaufmann, Ralph L.Tonks, AndrewWe consider three a priori totally different setups for Hopf algebras from number theory, mathematical physics and algebraic topology. These are the Hopf algebras of Goncharov for multiple zeta values, that of Connes--Kreimer for renormalization, and a Hopf algebra constructed by Baues to study double loop spaces. We show that these examples can be successively unified by considering simplicial objects, cooperads with multiplication and Feynman categories at the ultimate level. These considerations open the door to new constructions and reinterpretation of known constructions in a large common frameworkMeasuring satisfaction in societies with opinion leaders and mediators
http://hdl.handle.net/2117/101810
Measuring satisfaction in societies with opinion leaders and mediators
Molinero Albareda, Xavier; Riquelme Csori, F.; Serna Iglesias, María José
An opinion leader-follower model (OLF) is a two-action collective decision-making model for societies, in which three kinds of actors are considered:
Wed, 01 Mar 2017 16:19:14 GMThttp://hdl.handle.net/2117/1018102017-03-01T16:19:14ZMolinero Albareda, XavierRiquelme Csori, F.Serna Iglesias, María JoséAn opinion leader-follower model (OLF) is a two-action collective decision-making model for societies, in which three kinds of actors are considered: