2,976 research outputs found
Zonal polynomials via Stanley's coordinates and free cumulants
We study zonal characters which are defined as suitably normalized
coefficients in the expansion of zonal polynomials in terms of power-sum
symmetric functions. We show that the zonal characters, just like the
characters of the symmetric groups, admit a nice combinatorial description in
terms of Stanley's multirectangular coordinates of Young diagrams. We also
study the analogue of Kerov polynomials, namely we express the zonal characters
as polynomials in free cumulants and we give an explicit combinatorial
interpretation of their coefficients. In this way, we prove two recent
conjectures of Lassalle for Jack polynomials in the special case of zonal
polynomials.Comment: 45 pages, second version, important change
On the Fukaya Categories of Higher Genus Surfaces
We construct the Fukaya category of a closed surface equipped with an area
form using only elementary (essentially combinatorial) methods. We also compute
the Grothendieck group of its derived category.Comment: 40 pages, 17 figures. Final Versio
Optimal fault-tolerant placement of relay nodes in a mission critical wireless network
The operations of many critical infrastructures (e.g., airports) heavily depend on proper functioning of the radio communication network supporting operations. As a result, such a communication network is indeed a mission-critical communication network that needs adequate protection from external electromagnetic interferences. This is usually done through radiogoniometers. Basically, by using at least three suitably deployed radiogoniometers and a gateway gathering information from them, sources of electromagnetic emissions that are not supposed to be present in the monitored area can be localised. Typically, relay nodes are used to connect radiogoniometers to the gateway. As a result, some degree of fault-tolerance for the network of relay nodes is essential in order to offer a reliable monitoring. On the other hand, deployment of relay nodes is typically quite expensive. As a result, we have two conflicting requirements: minimise costs while guaranteeing a given fault-tolerance. In this paper address the problem of computing a deployment for relay nodes that minimises the relay node network cost while at the same time guaranteeing proper working of the network even when some of the relay nodes (up to a given maximum number) become faulty (fault-tolerance). We show that the above problem can be formulated as a Mixed Integer Linear Programming (MILP) as well as a Pseudo-Boolean Satisfiability (PB-SAT) optimisation problem and present experimental results com- paring the two approaches on realistic scenarios
- …