Norm inequalities in multidimensional Lorentz spaces

In this paper we obtain necessary and sufficient conditions for double trigonometric series to belong to generalized Lorentz spaces, not symmetric in general. Estimates for the norms are given in terms of coefficients.

Invariants de matrius Hadamard en MAGMA

L'objectiu d'aquest projecte ha estat generalitzar i integrar la funcionalitat de dos projectes anteriors que ampliaven el tractament que oferia el Magma respecte a les matrius de Hadamard. Hem implementat funcions genèriques que permeten construir noves matrius Hadamard de qualsevol mida per a cada rang i dimensió de nucli, i així ampliar la seva base de dades. També hem optimitzat la funció que calcula el nucli, i hem desenvolupat funcions que calculen la invariant Symmetric Hamming Distance Enumerator (SH-DE) proposada per Kai-Tai Fang i Gennian Gei que és més sensible per a la detecció de la no equivalència de les matrius Hadamard.

A class of stochastic games with infinitely many interacting agents related to Glauber dynamics on random graphs

We introduce and study a class of infinite-horizon nonzero-sum non-cooperative stochastic games with infinitely many interacting agents using ideas of statistical mechanics. First we show, in the general case of asymmetric interactions, the existence of a strategy that allows any player to eliminate losses after a finite random time. In the special case of symmetric interactions, we also prove that, as time goes to infinity, the game converges to a Nash equilibrium. Moreover, assuming that all agents adopt the same strategy, using arguments related to those leading to perfect simulation algorithms, spatial mixing and ergodicity are proved. In turn, ergodicity allows us to prove “fixation”, i.e. that players will adopt a constant strategy after a finite time. The resulting dynamics is related to zerotemperature Glauber dynamics on random graphs of possibly infinite volume.

Euclidean geometric invariant of framed knots in manifolds

We present an invariant of a three dimensional manifold with a framed knot in it based on the Reidemeister torsion of an acyclic complex of Euclidean geometric origin. To show its nontriviality, we calculate the invariant for some framed (un)knots in lens spaces. An important feature of our work is that we are not using any nontrivial representation of the manifold fundamental group or knot group.

A model category structure on the category of simplicial multicategories

We establish a Quillen model structure on simplicial(symmetric) multicategories. It extends the model structure on simplicial categories due to J. Bergner [2]. We observe that our technique of proof enables us to prove a similar result for (symmetric) multicategories enriched over other monoidal model categories than simplicial sets. Examples include small categories, simplicial abelian groups and compactly generated Hausdorff spaces.

Bargaining one-dimensional policies and the efficiency of super majority rules

We consider negotiations selecting one-dimensional policies. Individuals have single-peaked preferences, and they are impatient. Decisions arise from a bargaining game with random proposers and (super) majority approval, ranging from the simple majority up to unanimity. The existence and uniqueness of stationary subgame perfect equilibrium is established, and its explicit characterization provided. We supply an explicit formula to determine the unique alternative that prevails, as impatience vanishes, for each majority. As an application, we examine the efficiency of majority rules. For symmetric distributions of peaks unanimity is the unanimously preferred majority rule. For asymmetric populations rules maximizing social surplus are characterized.

The role of fixed delays in neuronal rate models

Fixed delays in neuronal interactions arise through synaptic and dendritic processing. Previous work has shown that such delays, which play an important role in shaping the dynamics of networks of large numbers of spiking neurons with continuous synaptic kinetics, can be taken into account with a rate model through the addition of an explicit, fixed delay. Here we extend this work to account for arbitrary symmetric patterns of synaptic connectivity and generic nonlinear transfer functions. Specifically, we conduct a weakly nonlinear analysis of the dynamical states arising via primary instabilities of the stationary uniform state. In this way we determine analytically how the nature and stability of these states depend on the choice of transfer function and connectivity. While this dependence is, in general, nontrivial, we make use of the smallness of the ratio in the delay in neuronal interactions to the effective time constant of integration to arrive at two general observations of physiological relevance. These are: 1 - fast oscillations are always supercritical for realistic transfer functions. 2 - Traveling waves are preferred over standing waves given plausible patterns of local connectivity.

Parallel spinors on pseudo-riemannian spin(q) manifolds

We study simply-connected irreducible non-locally symmetric pseudo-Riemannian Spin(q) manifolds admitting parallel quaternionic spinors.

A mixed finite element method for nonlinear diffusion equations

We propose a mixed finite element method for a class of nonlinear diffusion equations, which is based on their interpretation as gradient flows in optimal transportation metrics. We introduce an appropriate linearization of the optimal transport problem, which leads to a mixed symmetric formulation. This formulation preserves the maximum principle in case of the semi-discrete scheme as well as the fully discrete scheme for a certain class of problems. In addition solutions of the mixed formulation maintain exponential convergence in the relative entropy towards the steady state in case of a nonlinear Fokker-Planck equation with uniformly convex potential. We demonstrate the behavior of the proposed scheme with 2D simulations of the porous medium equations and blow-up questions in the Patlak-Keller-Segel model.

Integral formulae for a Riemannian manifold with a distribution

We obtain a new series of integral formulae for symmetric functions of curvature of a distribution of arbitrary codimension (an its orthogonal complement) given on a compact Riemannian manifold, which start from known formula by P.Walczak (1990) and generalize ones for foliations by several authors: Asimov (1978), Brito, Langevin and Rosenberg (1981), Brito and Naveira (2000), Andrzejewski and Walczak (2010), etc. Our integral formulae involve the co-nullity tensor, certain component of the curvature tensor and their products. The formulae also deal with a number of arbitrary functions depending on the scalar invariants of the co-nullity tensor. For foliated manifolds of constant curvature the obtained formulae give us the classical type formulae. For a special choice of functions our formulae reduce to ones with Newton transformations of the co-nullity tensor.

Civil war and foreign influence

We study a symmetric information bargaining model of civil war where a third (foreign) party can affect the probabilities of winning the conflict and the size of the post conflict spoils. We show that the possible alliance with a third party makes peaceful agreements difficult to reach and might lead to new commitment problems that trigger war. Also, we argue that the foreign party is likely to induce persistent informational asymmetries which might explain long lasting civil wars. We explore both political and economic incentives for a third party to intervene. The explicit consideration of political incentives leads to two predictions that allow for identifying the influence of foreign intervention on civil war incidence. Both predictions are confirmed for the case of the U.S. as a potential intervening nation: (i) civil wars around the world are more likely under Republican governments and (ii) the probability of civil wars decreases with U.S. presidential approval rates.

Refined asymptotics for the subcritical Keller-Segel system and related functional inequalities

We analyze the rate of convergence towards self-similarity for the subcritical Keller-Segel system in the radially symmetric two-dimensional case and in the corresponding one-dimensional case for logarithmic interaction. We measure convergence in Wasserstein distance. The rate of convergence towards self-similarity does not degenerate as we approach the critical case. As a byproduct, we obtain a proof of the logarithmic Hardy-Littlewood-Sobolev inequality in the one dimensional and radially symmetric two dimensional case based on optimal transport arguments. In addition we prove that the onedimensional equation is a contraction with respect to Fourier distance in the subcritical case.

Anàlisi i disseny d'un reflector per banda W

Les ones passives mil·limètriques (30 a 300GHz) tenen la peculiaritat de propagar-se en medis com la boira o la roba, a diferència del rang visible o l’infraroig. D’aquesta peculiaritat, surt l’interès de reproduir imatges per diverses aplicacions (seguretat, vigilància, etc...). És per aquest motiu que es treballa en el disseny d’un reflector per aquest tipus d’aplicació, treballant a una de les finestres de propagació d’aquest rang, la de la banda W. Es dissenyen i analitzen tres tipus de reflector: parabòlic simètric, offset i Cassegrain. D’aquests, s’estudien les seves figures de mèrit i directivitats buscant que aquestes siguin el més elevades possibles per obtenir una bona resolució, així com l’escaneig de l’escena de la qual es vol obtenir una imatge, veient aquí els efectes de les aberracions més comunes.

Candidate quality in a Downsian Model with a continuous policy space

This paper characterizes a mixed strategy Nash equilibrium in a one-dimensional Downsian model of two-candidate elections with a continuous policy space, where candidates are office motivated and one candidate enjoys a non-policy advantage over the other candidate. We assume that voters have quadratic preferences over policies and that their ideal points are drawn from a uniform distribution over the unit interval. In our equilibrium the advantaged candidate chooses the expected median voter with probability one and the disadvantaged candidate uses a mixed strategy that is symmetric around it. We show that this equilibrium exists if the number of voters is large enough relative to the size of the advantage.

A linear optimization technique for graph pebbling

Graph pebbling is a network model for studying whether or not a given supply of discrete pebbles can satisfy a given demand via pebbling moves. A pebbling move across an edge of a graph takes two pebbles from one endpoint and places one pebble at the other endpoint; the other pebble is lost in transit as a toll. It has been shown that deciding whether a supply can meet a demand on a graph is NP-complete. The pebbling number of a graph is the smallest t such that every supply of t pebbles can satisfy every demand of one pebble. Deciding if the pebbling number is at most k is NP 2 -complete. In this paper we develop a tool, called theWeight Function Lemma, for computing upper bounds and sometimes exact values for pebbling numbers with the assistance of linear optimization. With this tool we are able to calculate the pebbling numbers of much larger graphs than in previous algorithms, and much more quickly as well. We also obtain results for many families of graphs, in many cases by hand, with much simpler and remarkably shorter proofs than given in previously existing arguments (certificates typically of size at most the number of vertices times the maximum degree), especially for highly symmetric graphs. Here we apply theWeight Function Lemma to several specific graphs, including the Petersen, Lemke, 4th weak Bruhat, Lemke squared, and two random graphs, as well as to a number of infinite families of graphs, such as trees, cycles, graph powers of cycles, cubes, and some generalized Petersen and Coxeter graphs. This partly answers a question of Pachter, et al., by computing the pebbling exponent of cycles to within an asymptotically small range. It is conceivable that this method yields an approximation algorithm for graph pebbling.