Analysis of linear networks with inconsistent initial conditions

This paper presents a new method to analyze timeinvariant linear networks allowing the existence of inconsistent initial conditions. This method is based on the use of distributions and state equations. Any time-invariant linear network can be analyzed. The network can involve any kind of pure or controlled sources. Also, the transferences of energy that occur at t=O are determined, and the concept of connection energy is introduced. The algorithms are easily implemented in a computer program.

A Geometric Characterization of Interpolation in $\hat{\E}^\prime(\R)$

We give a geometric description of the interpolating varieties for the algebra of Fourier transforms of distributions (or Beurling ultradistributions) with compact support on the real line.

Performance Analysis of Two Quantum Reaction Dynamics Codes: Time-Dependent and Time-Independent Strategies

The computer simulation of reaction dynamics has nowadays reached a remarkable degree of accuracy. Triatomic elementary reactions are rigorously studied with great detail on a straightforward basis using a considerable variety of Quantum Dynamics computational tools available to the scientific community. In our contribution we compare the performance of two quantum scattering codes in the computation of reaction cross sections of a triatomic benchmark reaction such as the gas phase reaction Ne + H2+ %12. NeH++ H. The computational codes are selected as representative of time-dependent (Real Wave Packet [ ]) and time-independent (ABC [ ]) methodologies. The main conclusion to be drawn from our study is that both strategies are, to a great extent, not competing but rather complementary. While time-dependent calculations advantages with respect to the energy range that can be covered in a single simulation, time-independent approaches offer much more detailed information from each single energy calculation. Further details such as the calculation of reactivity at very low collision energies or the computational effort related to account for the Coriolis couplings are analyzed in this paper.

Esquemes de xifrat homomòrfics per a votació electrònica

This bachelor's degree thesis deals with homomorphic public-key cryptography, or in other words cryptosystems with special addition properties. Such cryptosystems are widely used in real life situations, for instance to make electronic voting secure. In Chapter 1 a few basic algebra results and other key concepts are introduced. Chapters 2 and 3 contain the algorithms and properties of the two cryptosystems which are considered to be the best for e-voting: Paillier and Joye-Libert. The thesis is concluded in Chapter 4, by comparing running times of the two above-mentioned cryptosystems, in simulations of real-life e-voting systems, with up to tens of thousands of voters, and different levels of security. Through these simulations, we discern the situations where each of the two cryptosystems is preferable.

Aplicaciones de la Teoría de Matrices en Matemática Discreta

Se describen algunas aplicaciones de la teoría de matrices a diversos temas pertenecientes alámbito de la matem\'atica discreta.

Robust power allocation algorithms for MIMO OFDM systems with imperfect CSI

This paper presents a Bayesian approach to the design of transmit prefiltering matrices in closed-loop schemes robust to channel estimation errors. The algorithms are derived for a multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) system. Two different optimizationcriteria are analyzed: the minimization of the mean square error and the minimization of the bit error rate. In both cases, the transmitter design is based on the singular value decomposition (SVD) of the conditional mean of the channel response, given the channel estimate. The performance of the proposed algorithms is analyzed,and their relationship with existing algorithms is indicated. As withother previously proposed solutions, the minimum bit error rate algorithmconverges to the open-loop transmission scheme for very poor CSI estimates.

Intrinsic subspace convergence in TDD MIMO communication

In numerical linear algebra, students encounter earlythe iterative power method, which finds eigenvectors of a matrixfrom an arbitrary starting point through repeated normalizationand multiplications by the matrix itself. In practice, more sophisticatedmethods are used nowadays, threatening to make the powermethod a historical and pedagogic footnote. However, in the contextof communication over a time-division duplex (TDD) multipleinputmultiple-output (MIMO) channel, the power method takes aspecial position. It can be viewed as an intrinsic part of the uplinkand downlink communication switching, enabling estimationof the eigenmodes of the channel without extra overhead. Generalizingthe method to vector subspaces, communication in thesubspaces with the best receive and transmit signal-to-noise ratio(SNR) is made possible. In exploring this intrinsic subspace convergence(ISC), we show that several published and new schemes canbe cast into a common framework where all members benefit fromthe ISC.

Symmetries of the free Schrödinger equation in the non-commutative plane

We study all the symmetries of the free Schr odinger equation in the non-commu- tative plane. These symmetry transformations form an infinite-dimensional Weyl algebra that appears naturally from a two-dimensional Heisenberg algebra generated by Galilean boosts and momenta. These infinite high symmetries could be useful for constructing non-relativistic interacting higher spin theories. A finite-dimensional subalgebra is given by the Schröodinger algebra which, besides the Galilei generators, contains also the dilatation and the expansion. We consider the quantization of the symmetry generators in both the reduced and extended phase spaces, and discuss the relation between both approaches.

Symmetries of the free Schrödinger equation in the non-commutative plane

We study all the symmetries of the free Schrödinger equation in the non-commu- tative plane. These symmetry transformations form an infinite-dimensional Weyl algebra that appears naturally from a two-dimensional Heisenberg algebra generated by Galilean boosts and momenta. These infinite high symmetries could be useful for constructing non-relativistic interacting higher spin theories. A finite-dimensional subalgebra is given by the Schröodinger algebra which, besides the Galilei generators, contains also the dilatation and the expansion. We consider the quantization of the symmetry generators in both the reduced and extended phase spaces, and discuss the relation between both approaches.

The differentiable chain functor is not homotopy equivalent to the continuous chain functor

Let $S_*$ and $S_*^\{infty}$ be the functors of continuous and differentiable singular chains on the category of differentiable manifolds. We prove that the natural transformation $i: S_*^\infty \rightarrow S_*$, which induces homology equivalences over each manifold, is not a natural homotopy equivalence.

Performance Analysis of Two Quantum Reaction Dynamics Codes: Time-Dependent and Time-Independent Strategies

The computer simulation of reaction dynamics has nowadays reached a remarkable degree of accuracy. Triatomic elementary reactions are rigorously studied with great detail on a straightforward basis using a considerable variety of Quantum Dynamics computational tools available to the scientific community. In our contribution we compare the performance of two quantum scattering codes in the computation of reaction cross sections of a triatomic benchmark reaction such as the gas phase reaction Ne + H2+ %12. NeH++ H. The computational codes are selected as representative of time-dependent (Real Wave Packet [ ]) and time-independent (ABC [ ]) methodologies. The main conclusion to be drawn from our study is that both strategies are, to a great extent, not competing but rather complementary. While time-dependent calculations advantages with respect to the energy range that can be covered in a single simulation, time-independent approaches offer much more detailed information from each single energy calculation. Further details such as the calculation of reactivity at very low collision energies or the computational effort related to account for the Coriolis couplings are analyzed in this paper.

Monoidal functors, acyclic models and chain operads

We prove that for a topological operad $P$ the operad of oriented cubical singular chains, $C^{\ord}_\ast(P)$, and the operad of simplicial singular chains, $S_\ast(P)$, are weakly equivalent. As a consequence, $C^{\ord}_\ast(P\nsemi\mathbb{Q})$ is formal if and only if $S_\ast(P\nsemi\mathbb{Q})$ is formal, thus linking together some formality results which are spread out in the literature. The proof is based on an acyclic models theorem for monoidal functors. We give different variants of the acyclic models theorem and apply the contravariant case to study the cohomology theories for simplicial sets defined by $R$-simplicial differential graded algebras.