Search results for "complex"

Segre and the Foundations of Geometry: From Complex Projective Geometry to Dual Numbers

2016

In 1886 Corrado Segre wrote to Felix Klein about his intention to study ‘geometrie projective pure’, completing and developing the work of von Staudt. He would continue this research project throughout the whole of his scientific life. In 1889, following a suggestion of Segre, Mario Pieri published his translation of the Geometrie der Lage, and from 1889 to 1890 Segre published four important papers, “Un nuovo campo di ricerche geometriche”, in which he completely developed complex projective geometry, considering new mathematical objects such as antiprojectivities and studying the Hermitian forms from a geometrical point of view with the related ‘hyperalgebraic varieties’. Segre developed …

QUANTIZATION OPERATORS ON QUADRICS

2008

Brauer's height zero conjecture for the 2-blocks of maximal defect

2012

Kontsevich formality and cohomologies for graphs

2004

A formality on a manifold M is a quasi isomorphism between the space of polyvector fields (Tpoly(M)) and the space of multidifferential operators (Dpoly(M)). In the case M=R d , such a mapping was explicitly built by Kontsevich, using graphs drawn in configuration spaces. Looking for such a construction step by step, we have to consider several cohomologies (Hochschild, Chevalley, and Harrison and Chevalley) for mappings defined on Tpoly. Restricting ourselves to the case of mappings defined with graphs, we determine the corresponding coboundary operators directly on the spaces of graphs. The last cohomology vanishes.

Perron type integral on compact zero-dimensional Abelian groups

2008

Perron and Henstock type integrals defined directly on a compact zero-dimensional Abelian group are studied. It is proved that the considered Perron type integral defined by continuous majorants and minorants is equivalent to the integral defined in the same way, but without assumption on continuity of majorants and minorants.

Improving Interpolants for Linear Arithmetic

2015

Craig interpolation for satisfiability modulo theory formulas have come more into focus for applications of formal verification. In this paper we, introduce a method to reduce the size of linear constraints used in the description of already computed interpolant in the theory of linear arithmetic with respect to the number of linear constraints. We successfully improve interpolants by combining satisfiability modulo theory and linear programming in a local search heuristic. Our experimental results suggest a lower running time and a larger reduction compared to other methods from the literature.

Vectors and Vector Fields

2012

The purpose of this book is to explain in a rigorous way Stokes’s theorem and to facilitate the student’s use of this theorem in applications. Neither of these aims can be achieved without first agreeing on the notation and necessary background concepts of vector calculus, and therein lies the motivation for our introductory chapter.

A note on conjugation involutions on homotopy complex projective spaces

1986

Analytic vectors, anomalies and star representations

1989

It is hinted that anomalies are not really anomalous since (at least in characteristic examples) they can be related to a lack of common analytic vectors for the Hamiltonian and the observables. We reanalyze the notions of analytic vectors and of local representations of Lie algebras in this light, and show how the notion of preferred observables introduced in the deformation (star product) approach to quantization may help give an anomaly-free formulation to physical problems. Finally, some remarks are made concerning the applicability of these considerations to field theory, especially in two dimensions.

Paths Coloring Algorithms in Mesh Networks

2003

In this paper, we will consider the problem of coloring directed paths on a mesh network. A natural application of this graph problem is WDM-routing in all-optical networks. Our main result is a simple 4-approximation algorithm for coloring line-column paths on a mesh. We also present sharper results when there is a restriction on the path lengths. Moreover, we show that these results can be extended to toroidal meshes and to line-column or column-line paths.