Projective Formalism and Some Methods from Algebraic Geometry in the Theory of Gravitation

The purpose of this paper is to propose the implementation of some methods from algebraic geometry in the theory of gravitation, and more especially in the variational formalism. It has been assumed that the metric tensor depends on two vector fields, defined on a manifold, and also that the gravitational Lagrangian depends on the metric tensor and its first and second differentials (instead on the partial or covariant derivatives, as usually assumed). Assuming also different operators of variation and differentiation, it has been shown that the first variation of the gravitational Lagrangian can be represented as a third-rank polynomial in respect to the variables, defined in terms of the variated or differentiated vector fields. Therefore, the solution of the variational problem is found to be equivalent to finding all the variables - elements of an algebraic variety, which satisfy the algebraic equation.Comment: Latex (amsmath style), 10 pages, no figures; to appear in Proceedings of the Fifth International Workshop on Complex Structures and Vector Fields, (September 2000, St.Konstantine,Bulgaria), World Scientific,Singapore, 2001, eds. K.Sekigawa, S.Dimie

Feedback Allocation For OFDMA Systems With Slow Frequency-domain Scheduling

We study the problem of allocating limited feedback resources across multiple users in an orthogonal-frequency-division-multiple-access downlink system with slow frequency-domain scheduling. Many flavors of slow frequency-domain scheduling (e.g., persistent scheduling, semi-persistent scheduling), that adapt user-sub-band assignments on a slower time-scale, are being considered in standards such as 3GPP Long-Term Evolution. In this paper, we develop a feedback allocation algorithm that operates in conjunction with any arbitrary slow frequency-domain scheduler with the goal of improving the throughput of the system. Given a user-sub-band assignment chosen by the scheduler, the feedback allocation algorithm involves solving a weighted sum-rate maximization at each (slow) scheduling instant. We first develop an optimal dynamic-programming-based algorithm to solve the feedback allocation problem with pseudo-polynomial complexity in the number of users and in the total feedback bit budget. We then propose two approximation algorithms with complexity further reduced, for scenarios where the problem exhibits additional structure.Comment: Accepted to IEEE Transactions on Signal Processin

On Statistical Hypothesis Testing via Simulation Method

A procedure for calculating critical level and power of likelihood ratio test, based on a Monte-Carlo simulation method is proposed. General principles of software building for its realization are given. Some examples of its application are shown