Embedding a polytope in a lattice

We present a special similarity ofR ⁴ⁿ which maps lattice points into lattice points. Applying this similarity, we prove that if a (4n−1)-polytope is similar to a lattice polytope (a polytope whose vertices are all lattice points) inR ⁴ⁿ , then it is similar to a lattice polytope inR ⁴ⁿ⁻¹, generalizing a result of Schoenberg [4]. We also prove that ann-polytope is similar to a lattice polytope in someR ^N if and only if it is similar to a lattice polytope inR ²ⁿ⁺¹, and if and only if sin²(<ABC) is rational for any three verticesA, B, C of the polytope.     

Existence of a time-like periodic trajectory for a time-dependent Lorentz metric

In this paper we deal with the problem of the existence ofT-periodic geodesics inR ^N × R equipped with a Lorentz metric g(x, t)[·, ·] which depends ontεR.     

The torsion of a submanifold of a Riemannian manifold

For a submanifoldM ⁿ of a Riemannian manifoldM ^q, the concept of a torsion bivector at the point x M ⁿ for given one- and two-dimensional directions fromT _x M ⁿ is introduced using only the first and second fundamental forms ofM ⁿ. Its relation to the concept of Gaussian torsion is then established. It is proved that: 1) equality to zero of the torsion bivector is necessary and, whenM ⁿ is a nondevelopable surface of a space of constant curvature with nonzero second fundamental form, is also sufficient for the "flattening" ofM ⁿ into some totally geodesicM ⁿ⁺¹ inM ^q; 2) when n = 2, the independence of the nonzero torsion bivector of direction characterizes a minimalM ² inM ^q.Translated from Ukrainskii Geometricheskii Sbornik, No. 34, pp. 39–42, 1991.     

When is a ring of torus invariants a polynomial ring?

Let ρ:T→GL(V) be a finite dimensional rational representation of a torus over an algebraically closed fieldk. We give necessary and sufficient conditions on the arrangement of the weights ofV within the character lattice ofT for the ring of invariants,k[V] ^T , to have a homogeneous system of parameters consisting of monomials (Theorem 4.1). Using this we give two simple constructive criteria each of which gives necessary and sufficient conditions fork[V] ^T to be a polynomial ring (Theorem 5.8 and Theorem 5.10). Research supported in part by NSERC Grant OGP 137522     

The Number of Geometric Bistellar Neighbors of a Triangulation

The theory of secondary and fiber polytopes implies that regular (also called convex or coherent) triangulations of configurations with n points in R ^d have at least n-d-1 geometric bistellar neighbors. Here we prove that, in fact, all triangulations of n points in R ² have at least n-3 geometric bistellar neighbors. In a similar way, we show that for three-dimensional point configurations, in convex position and with no three points collinear, all triangulations have at least n-4 geometric bistellar flips. In contrast, we exhibit three-dimensional point configurations, with a single interior point, having deficiency on the number of geometric bistellar flips. A lifting technique allows us to obtain a triangulation of a simplicial convex 4-polytope with less than n-5 neighbors. We also construct a family of point configurations in R ³ with arbitrarily large flip deficiency. Received November 25, 1996, and in revised form March 10, 1997.     

Quantified propositional calculus and a second-order theory for NC1

Let H be a proof system for quantified propositional calculus (QPC). We define the Σ^q_j-witnessing problem for H to be: given a prenex Σ^q_j-formula A, an H-proof of A, and a truth assignment to the free variables in A, find a witness for the outermost existential quantifiers in A. We point out that the Σ^q₁-witnessing problems for the systems G^*₁and G₁ are complete for polynomial time and PLS (polynomial local search), respectively. We introduce and study the systems G^*₀ and G₀, in which cuts are restricted to quantifier-free formulas, and prove that the Σ^q_j-witnessing problem for each is complete for NC¹. Our proof involves proving a polynomial time version of Gentzen’s midsequent theorem for G^*₀ and proving that G₀-proofs are TC⁰-recognizable. We also introduce QPC systems for TC⁰ and prove witnessing theorems for them. We introduce a finitely axiomatizable second-order system VNC¹ of bounded arithmetic which we prove isomorphic to Arai’s first order theory AID + Σ^b ₀-CA for uniform NC¹. We describe simple translations of VNC¹ proofs of all bounded theorems to polynomial size families of G^*₀ proofs. From this and the above theorem we get alternative proofs of the NC¹ witnessing theorems for VNC¹ and AID.This research was carried while this author was a student at the University of Toronto.     

Consistency of a nonparametric conditional quantile estimator for random fields

Given a stationary multidimensional spatial process (Z _i = (X _i , Y _i ) ∈ ℝ ^d × ℝ, i ∈ ℤ ^N ), we investigate a kernel estimate of the spatial conditional quantile function of the response variable Y _i given the explicative variable X _i . Almost complete convergence and consistency in L ^2r norm (r ∈ ℕ*) of the kernel estimate are obtained when the sample considered is an α-mixing sequence.     

Coherent Sheaves on P1: their Families and their Deformations Related to a Behavioral Approach to Singular Systems

Recently, Lomadze, Ravi, Rosenthal and Schumacher gave a natural and geometrically meaningful one-to-one correspondence between abstract linar behaviors and coherent sheaves on P ¹. Motivated by their result, here we give a complete picture of the deformation theory of coherent sheaves on P ¹. We use our results to study deformations over the field R obtaining a connectedness result for the real locus of the algebraic parameter spaces.     

Representing a Functional Curve by Curves with Fewer Peaks

In this paper, we study the problems of (approximately) representing a functional curve in 2-D by a set of curves with fewer peaks. Representing a function (or its curve) by certain classes of structurally simpler functions (or their curves) is a basic mathematical problem. Problems of this kind also find applications in applied areas such as intensity-modulated radiation therapy (IMRT). Let f\bf f be an input piecewise linear functional curve of size n. We consider several variations of the problems. (1) Uphill–downhill pair representation (UDPR): Find two nonnegative piecewise linear curves, one nondecreasing (uphill) and one nonincreasing (downhill), such that their sum exactly or approximately represents f\bf f. (2) Unimodal representation (UR): Find a set of unimodal (single-peak) curves such that their sum exactly or approximately represents f\bf f. (3) Fewer-peak representation (FPR): Find a piecewise linear curve with at most k peaks that exactly or approximately represents f\bf f. Furthermore, for each problem, we consider two versions. For the UDPR problem, we study its feasibility version: Given ε>0, determine whether there is a feasible UDPR solution for f\bf f with an approximation error ε; its min-ε version: Compute the minimum approximation error ε ^∗ such that there is a feasible UDPR solution for f\bf f with error ε ^∗. For the UR problem, we study its min-k version: Given ε>0, find a feasible solution with the minimum number k ^∗ of unimodal curves for f\bf f with an error ε; its min-ε version: given k>0, compute the minimum error ε ^∗ such that there is a feasible solution with at most k unimodal curves for f\bf f with error ε ^∗. For the FPR problem, we study its min-k version: Given ε>0, find one feasible curve with the minimum number k ^∗ of peaks for f\bf f with an error ε; its min-ε version: given k≥0, compute the minimum error ε ^∗ such that there is a feasible curve with at most k peaks for f\bf f with error ε ^∗. Little work has been done previously on solving these functional curve representation problems. We solve all the problems (except the UR min-ε version) in optimal O(n) time, and the UR min-ε version in O(n+mlog m) time, where m<n is the number of peaks of f\bf f. Our algorithms are based on new geometric observations and interesting techniques.     

Cohomology vanishing¶and a problem in approximation theory

For a simplicial subdivison Δ of a region in k ⁿ (k algebraically closed) and r∈N, there is a reflexive sheaf ? on P ⁿ , such that H ⁰(?(d)) is essentially the space of piecewise polynomial functions on Δ, of degree at most d, which meet with order of smoothness r along common faces. In [9], Elencwajg and Forster give bounds for the vanishing of the higher cohomology of a bundle ℰ on P ⁿ in terms of the top two Chern classes and the generic splitting type of ℰ. We use a spectral sequence argument similar to that of [16] to characterize those Δ for which ? is actually a bundle (which is always the case for n= 2). In this situation we can obtain a formula for H ⁰(?(d)) which involves only local data; the results of [9] cited earlier allow us to give a bound on the d where the formula applies. We also show that a major open problem in approximation theory may be formulated in terms of a cohomology vanishing on P ² and we discuss a possible connection between semi-stability and the conjectured answer to this open problem. Received: 9 April 2001     

Compact,convex sets in R n and a new banach lattice. I.- Theory.

The present paper shows that compact, non-empty convex sets in R ⁿ form a wedge in a well-defined Banach lattice, which turns out to be isometrically Riesz-isomorphic to the continuous functions in S ^n–1, the unit sphere of R ⁿ . Among other results, we obtain Dini-like convergence results for sets, linking order- and norm-convergence.     

Reproducing kernels of generalized Sobolev spaces via a Green function approach with distributional operators

In this paper we introduce a generalized Sobolev space by defining a semi-inner product formulated in terms of a vector distributional operator P consisting of finitely or countably many distributional operators P _n , which are defined on the dual space of the Schwartz space. The types of operators we consider include not only differential operators, but also more general distributional operators such as pseudo-differential operators. We deduce that a certain appropriate full-space Green function G with respect to L := P ^*T P now becomes a conditionally positive function. In order to support this claim we ensure that the distributional adjoint operator P ^* of P is well-defined in the distributional sense. Under sufficient conditions, the native space (reproducing-kernel Hilbert space) associated with the Green function G can be embedded into or even be equivalent to a generalized Sobolev space. As an application, we take linear combinations of translates of the Green function with possibly added polynomial terms and construct a multivariate minimum-norm interpolant s _f,X to data values sampled from an unknown generalized Sobolev function f at data sites located in some set X ì \mathbbR^d{X \subset \mathbb{R}^d}. We provide several examples, such as Matérn kernels or Gaussian kernels, that illustrate how many reproducing-kernel Hilbert spaces of well-known reproducing kernels are equivalent to a generalized Sobolev space. These examples further illustrate how we can rescale the Sobolev spaces by the vector distributional operator P. Introducing the notion of scale as part of the definition of a generalized Sobolev space may help us to choose the “best” kernel function for kernel-based approximation methods.     

Limsup results and LIL for partial sum processes of a Gaussian random field

Let {ξ _j ; j ∈ ℤ₊ ^d be a centered stationary Gaussian random field, where ℤ₊ ^d is the d-dimensional lattice of all points in d-dimensional Euclidean space ℝ^d, having nonnegative integer coordinates. For each j = (j ₁ , ..., jd) in ℤ₊ ^d , we denote |j| = j ₁ ... j _d and for m, n ∈ ℤ₊ ^d , define S(m, n] = Σ _m<j≤n ζ _j , σ²(|n−m|) = ES ² (m, n], S _n = S(0, n] and S ₀ = 0. Assume that σ(|n|) can be extended to a continuous function σ(t) of t > 0, which is nondecreasing and regularly varying with exponent α at b ≥ 0 for some 0 < α < 1. Under some additional conditions, we study limsup results for increments of partial sum processes and prove as well the law of the iterated logarithm for such partial sum processes. Research supported by NSERC Canada grants at Carleton University, Ottawa     

On the connectedness of the scheme of multisecants to a projective curve

Here we study the connectedness of the scheme of multisecant linear spaces to a curveC P ⁿ . In particular we prove the connectedness of the scheme of trisecant lines of a smoothC P ³ with non-special hyperplane section.     

Tame comodule type,roiter bocses,and a geometry context for coalgebras

We study the class of coalgebras C of fc-tame comodule type introduced by the author. With any basic computable K-coalgebra C and a bipartite vector v = (v′|v″) ∈ K ₀(C) × K ₀(C), we associate a bimodule matrix problem Mat ^v _C (ℍ), an additive Roiter bocs B ^C _v , an affine algebraic K-variety Comod ^C _v , and an algebraic group action G ^C _v × Comod ^C _v → Comod ^C _v . We study the fc-tame comodule type and the fc-wild comodule type of C by means of Mat ^v _C (ℍ), the category rep _K (B ^C _v ) of K-linear representations of B ^C _v , and geometry of G ^C _v -orbits of Comod ^C _v . For computable coalgebras C over an algebraically closed field K, we give an alternative proof of the fc-tame-wild dichotomy theorem. A characterization of fc-tameness of C is given in terms of geometry of G ^C _v -orbits of Comod _v . In particular, we show that C is fc-tame of discrete comodule type if and only if the number of G ^C _v -orbits in Comod ^C _v is finite for every v = (v′|v″) ∈ K ₀(C) × K ₀(C).     

A Property About Minimum Edge- and Minimum Clique-Cover of a Graph

 Let G be a graph with n vertices, and denote as γ(G) (as θ(G)) the cardinality of a minimum edge cover (of a minimum clique cover) of G. Let E (let C) be the edge-vertex (the clique-vertex) incidence matrix of G; write then P(E)={x∈ℜ ⁿ :Ex≤1,x≥0}, P(C)={x∈ℜ ⁿ :Cx≤1,x≥0}, α _E (G)=max{1 ^T x subject to x∈P(E)}, and α _C (G)= max{1 ^T x subject to x∈P(C)}. In this paper we prove that if α _E (G)=α _C (G), then γ(G)=θ(G). Received: May 20, 1998?Final version received: April 12, 1999     

On the set of grouplikes of a coring

We focus our attention to the set Gr(■) of grouplike elements of a coring ■ over a ring A.We do some observations on the actions of the groups U(A) and Aut(■) of units of A and of automorphisms of corings of ■,respectively,on Gr(■),and on the subset Gal(■) of all Galois grouplike elements.Among them,we give conditions on ■ under which Gal(■) is a group,in such a way that there is an exact sequence of groups {1} → U(Ag) → U(A) → Gal(■) → {1},where Ag is the subalgebra of coinvariants for some g ∈ Gal(■).     

Clairaut relation for geodesics of Hopf tubes

Summary In this note we use the Hopf map π: S³ → S² to construct an interesting family of Riemannian metrics h^fon the 3-sphere, which are parametrized on the space of positive smooth functions f on the 2-sphere. All these metrics make the Hopf map a Riemannian submersion. The Hopf tube over an immersed curve γ in S² is the complete lift π^-1(γ) of γ, and we prove that any geodesic of this Hopf tube satisfies a Clairaut relation. A Hopf tube plays the role in S³ of the surfaces of revolution in R^3. Furthermore, we show a geometric integration method of the Frenet equations for curves in those non-standard S³. Finally, if we consider the sphere S³ equipped with a family h^f of Lorentzian metrics, then a new Clairautrelation is also obtained for timelike geodesics of the Lorentzian Hopf tube, and a geometric integration method for curves is still possible.     

The hardy-littlewood maximal function of a sobolev function

We prove that the Hardy-Littlewood maximal operator is bounded in the Sobolev spaceW ^1,p (R ⁿ ) for 1<p≤∞. As an application we study a weak type inequality for the Sobolev capacity. We also prove that the Hardy-Littlewood maximal function of a Sobolev function is quasi-continuous.     

An Upper and a Lower Bound Theorem for Combinatorial 4-Manifolds

In this paper we prove two inequalities. The first one gives a lower bound for the Euler characteristic of a tight combinatorial 4-manifold M under the additional assumptions that |M| is 1-connected, that M is a subcomplex of H (M) , and that H (M) is a centrally symmetric and simplicial d -polytope. The second inequality relates the Euler characteristic with the number of vertices of a combinatorial 4-manifold admitting a fixed-point free involution. Furthermore, we construct a new and highly symmetric 12-vertex triangulation of S ² x S ² realizing equality in each of these inequalities. Received January 23, 1996, and in revised form September 13, 1996.