The full basis theorem does not imply analytic wellordering

A finite support product of ${\omega }_1$ clones of Jensen's minimal ${\Pi }_2^1$ singleton forcing is used to define a model in which any non-empty analytically definable set of reals contains an analytically definable real (the full basis theorem), but there is no analytically definable wellordering of the reals.     

Projective geometry and special relativity

Some concepts of real and complex projective geometry are applied to the fundamental physical notions that relate to Minkowski space and the Lorentz group. In particular, it is shown that the transition from an infinite speed of propagation for light waves to a finite one entails the replacement of a hyperplane at infinity with a light cone and the replacement of an affine hyperplane – or rest space – with a proper time hyperboloid. The transition from the metric theory of electromagnetism to the pre‐metric theory is discussed in the context of complex projective geometry, and ultimately, it is proposed that the geometrical issues are more general than electromagnetism, namely, they pertain to the transition from point mechanics to wave mechanics.     

A characterization of projective-planar signed graphs

A signed graph has a plus or minus sign on each edge. A simple cycle is positive or negative depending on whether it contains an even or odd number of negative edges, respectively. We consider embeddings of a signed graph in the projective plane for which a simple cycle is essential if and only if it is negative. We characterize those signed graphs that have such a projective-planar embedding. Our characterization is in terms of a related signed graph formed by considering the theta subgraphs in the given graph.     

Risk-neutral valuation with infinitely many trading dates

The first Fundamental Theorem of Asset Pricing establishes the equivalence between the absence of arbitrage in financial markets and the existence of Equivalent Martingale Measures, if appropriate conditions hold. Since the theorem may fail when dealing with infinitely many trading dates, this paper draws on the A.A. Lyapunov Theorem in order to retrieve the equivalence for complete markets such that the Sharpe Ratio is adequately bounded.     

How much sweetness is there in the universe?

We continue investigations of forcing notions with strong ccc properties introducing new methods of building sweet forcing notions. We also show that quotients of topologically sweet forcing notions over Cohen reals are topologically sweet while the quotients over random reals do not have to be such. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

New reals: Can live with them,can live without them

We give a self‐contained proof of the preservation theorem for proper countable support iterations known as “tools‐preservation”, “Case A” or “first preservation theorem” in the literature. We do not assume that the forcings add reals. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Global Forcing Number of Benzenoid Graphs

A global forcing set in a simple connected graph G with a perfect matching is any subset S of E(G) such that the restriction of the characteristic function of perfect matchings of G on S is an injection. The number of edges in a global forcing set of the smallest cardinality is called the global forcing number of G. In this paper we prove several results concerning global forcing sets and numbers of benzenoid graphs. In particular, we prove that all catacondensed benzenoids and catafused coronoids with n hexagons have the global forcing number equal to n, and that for pericondensed benzenoids the global forcing number is always strictly smaller than the number of hexagons.     

Covering projective planar graphs with three forests

It is known that all planar graphs and all projective planar graphs have an edge partition into three forests. Gonçalves proved that every planar graph has an edge partition into three forests, one having maximum degree at most four [5]. In this paper, we prove that every projective planar graph has an edge partition into three forests, one having maximum degree at most four.     

Projective Reed–Muller type codes on rational normal scrolls

In this paper we study an instance of projective Reed–Muller type codes, i.e., codes obtained by the evaluation of homogeneous polynomials of a fixed degree in the points of a projective variety. In our case the variety is an important example of a determinantal variety, namely the projective surface known as rational normal scroll, defined over a finite field, which is the basic underlining algebraic structure of this work. We determine the dimension and a lower bound for the minimum distance of the codes, and in many cases we also find the exact value of the minimum distance. To obtain the results we use some methods from Gröbner bases theory.