Twisted cubics, bis

We consider the smooth compactification constructed in [12] for a space of varieties like twisted cubics. We show this compactification embeds naturally in a product of flag varieties.Partially supported by CNPq, Pronex (ALGA)     

On the sum of the Laplacian eigenvalues of a tree

Given an n-vertex graph G=(V,E), the Laplacian spectrum of G is the set of eigenvalues of the Laplacian matrix L=D-A, where D and A denote the diagonal matrix of vertex-degrees and the adjacency matrix of G, respectively. In this paper, we study the Laplacian spectrum of trees. More precisely, we find a new upper bound on the sum of the k largest Laplacian eigenvalues of every n-vertex tree, where k∈{1,…,n}. This result is used to establish that the n-vertex star has the highest Laplacian energy over all n-vertex trees, which answers affirmatively to a question raised by Radenkovi? and Gutman [10].     

Symplectic Matroids

A symplectic matroid is a collection B of k-element subsets of J = {1, 2, ..., n, 1*, 2*, ...; n*}, each of which contains not both of i and i* for every i n, and which has the additional property that for any linear ordering of J such that i j implies j* i* and i j* implies j i* for all i, j n, B has a member which dominates element-wise every other member of B. Symplectic matroids are a special case of Coxeter matroids, namely the case where the Coxeter group is the hyperoctahedral group, the group of symmetries of the n-cube. In this paper we develop the basic properties of symplectic matroids in a largely self-contained and elementary fashion. Many of these results are analogous to results for ordinary matroids (which are Coxeter matroids for the symmetric group), yet most are not generalizable to arbitrary Coxeter matroids. For example, representable symplectic matroids arise from totally isotropic subspaces of a symplectic space very similarly to the way in which representable ordinary matroids arise from a subspace of a vector space. We also examine Lagrangian matroids, which are the special case of symplectic matroids where k = n, and which are equivalent to Bouchet's symmetric matroids or 2-matroids.     

The “Essential Tension” at Work in Qualitative Analysis: A Case Study of the Opposite Points of View of Poincaré and Enriques on the Relationships between Analysis and Geometry

An analysis of the different philosophic and scientific visions of Henri Poincaré and Federigo Enriques relative to qualitative analysis provides us with a complex and interesting image of the “essential tension” between “tradition” and “innovation” within the history of science. In accordance with his scientific paradigm, Poincaré viewed qualitative analysis as a means for preserving the nucleus of the classical reductionist program, even though it meant “bending the rules” somewhat. To Enriques's mind, qualitative analysis represented the affirmation of a synthetic, geometrical vision that would supplant the analytical/quantitative conception characteristic of 19th-century mathematics and mathematical physics. Here, we examine the two different answers given at the turn of the century to the question of the relationship between geometry and analysis and between mathematics, on the one hand, and mechanics and physics, on the other.Copyright 1998 Academic Press.Un'analisi delle diverse posizioni filosofiche e scientifiche di Henri Poincaré e Federigo Enriques nei riguardi dell'analisi qualitativa fornisce un'immagine complessa e interessante della “tensione essenziale” tra “tradizione” e “innovazione” nell'ambito della storia della scienza. In linea con il proprio paradigma scientifico, Poincaré vedeva nell'analisi qualitativa un mezzo per preservare il nucleo del programma riduzionista calssico, anche se cio comportava una lieve “distorsione delle regole”. Nella mente di Enriques, l'analisi qualitativa rappresentava l'affermazione di un punto di vista sintetico e geometrico che avrebbe soppiantato la concezione analitico-quantitativa caratteristica della matematica e della fisica matematica del 19° secolo. Il nostro scopo principale è di esaminare due diverse risposte date a cavallo del secolo alla questione dei rapporti tra geometria e analisi e tra matematica da un lato e meccanica e fisica dall'altro.Copyright 1998 Academic Press.AMS subject classification: 01A55     

Analysis of a statistical multiplexer with generalized periodic sources

We provide solution techniques for the analysis of multiplexers with periodic arrival streams, which accurately account for the effects of active and idle periods and of gradual arrival. In the models considered in this paper, it is assumed that each source alternates (periodically) between active and idle periods of fixed durations. Incoming packets are transmitted on the network link and excess information is stored in the multiplexing buffer when the aggregate input rate exceeds the capacity of the link. We are interested in the probability distribution of the buffer content for a given network link speed as a function of the number of sources and their characteristics, i.e., rate and duration of idle and active periods. We derive this distribution from two models: discrete time and continuous time systems. Discrete time systems operate in a slotted fashion, with a slot defining the base unit for data generation and transmission. In particular, in each slot the link is capable of transmitting one data unit and conversely an active source generates one data unit in that time. The continuous time model of the paper falls in the category of fluid models. Compared to previous works we allow a more general model for the periodic packet arrival process of each source. In discrete time, this means that the active period of a source can now extend over several consecutive slots instead of a single slot as in previous models. In continuous time, packet arrivals are not required to be instantaneous, but rather the data generation process can now take place over the entire duration of the active period. In both cases, these generalizations allow us to account for the progressive arrival of source data as a function of both the source speed and the amount of data it generates in an active period.This work was done while at the IBM T.J. Watson Research Center.This work was done while at the IBM T.J. Watson Research Center.Part of the work was done while visiting the IBM T.J. Watson Research Center.     

Linearizability of d-webs, d ≥ 4, on two-dimensional manifolds

We find d − 2 relative differential invariants for a d-web, d ≥ 4, on a two-dimensional manifold and prove that their vanishing is necessary and sufficient for a d-web to be linearizable. If one writes the above invariants in terms of web functions f(x, y) and g ₄(x, y),..., g _d (x, y), then necessary and sufficient conditions for the linearizabilty of a d-web are two PDEs of the fourth order with respect to f and g ₄, and d − 4 PDEs of the second order with respect to f and g ₄,..., g _d . For d = 4, this result confirms Blaschke’s conjecture on the nature of conditions for the linearizabilty of a 4-web. We also give the Mathematica codes for testing 4- and d-webs (d > 4) for linearizability and examples of their usage.     

NONLOCAL INITIAL PROBLEM FOR NONLINEAR NONAUTONOMOUS DIFFERENTIAL EQUATIONS IN A BANACH SPACE

The nonlocal initial problem for nonlinear nonautonomous evolution equati-ons in a Banach space is considered. It is assumed that the nonlinearities havethe local Lipschitz properties. The existence and uniqueness of mild solutionsare proved. Applications to integro-differential equations are discussed.The main tool in the paper is the normalizing mapping (the generalizednorm).     

Linear complexity algorithm for semiseparable matrices

A new linear complexity algorithm for general nonsingular semiseparable matrices is presented. For symmetric matrices whose semiseparability rank equals to 1 this algorithm leads to an explicit formula for the inverse matrix.Supported in part by the NSF Grant DMS 9306357     

On Grassmannizable Group 3-Webs

The authors prove that the Lie group G generating a Grassmannizable group 3-web GGW is the group of parameters of the group of similarity transformations of an (r−1)-dimensional affine space . The transitive action of the group G on itself is an r-parameter subgroup B(r) of the group A(r ²+r) of affine transformations z ^I =a _J ^I x ^J +b ^I ,I,J=1,…,r, which is the direct product of the one-dimensional group of homotheties z ¹=kx ¹ and r−1 one-dimensional groups of affine transformations where all r groups have the same homothety coefficient k. Conversely, the Lie group B(r) described above generates a Grassmannizable group 3-web GGW. The Lie group G is solvable but not nilpotent.