Algebra Forms with $$d^{N} = 0$$ on Quantum Plane. Generalized Clifford Algebra Approach

We construct a q-analog of exterior calculus with a differential d satisfying d ^N = 0, where N ≥ 2 and q is a primitive Nth root of unity, on a noncommutative space and introduce a notion of a q-differential k-form. A noncommutative space we consider is a reduced quantum plane. Our construction of a q-analog of exterior calculus is based on a generalized Clifford algebra with four generators and on a graded q-differential algebra. We study the structure of the algebra of q-differential forms on a reduced quantum plane and show that the first order calculus induced by the differential d is a coordinate calculus. The explicit formulae for partial derivatives of this first order calculus are found.     

Some results on embeddings of algebras, after de Bruijn and McKenzie

In 1957, N.G. de Bruijn showed that the symmetric group Sym(Ω) on an infinite set Ω contains a free subgroup on 2^card(Ω) generators, and proved a more general statement, a sample consequence of which is that for any group A of cardinality card(Ω), the group Sym(Ω) contains a coproduct of 2^card(Ω) copies of A, not only in the variety of all groups, but in any variety of groups to which A belongs. His key lemma is here generalized to an arbitrary variety of algebras V, and formulated as a statement about functors Set V. From this one easily obtains analogs of the results stated above with “group” and Sym(Ω) replaced by “monoid” and the monoid Self(Ω) of endomaps of Ω, by “associative K-algebra” and the K-algebra End_K (V) of endomorphisms of a K-vector-space V with basis Ω, and by “lattice” and the lattice Equiv(Ω) of equivalence relations on Ω. It is also shown, extending another result from de Bruijn's 1957 paper, that each of Sym(Ω), Self(Ω) and End_K(V) contains a coproduct of 2^card(Ω) copies of itself.That paper also gave an example of a group of cardinality 2^card(Ω) that was not embeddable in Sym(Ω), and R. McKenzie subsequently established a large class of such examples. Those results are shown here to be instances of a general property of the lattice of solution sets in Sym(Ω) of sets of equations with constants in Sym(Ω). Again, similar results - this time of varying strengths - are obtained for Self(Ω), End_K(V), and Equiv(Ω), and also for the monoid Rel(Ω) of binary relations on Ω.Many open questions and areas for further investigation are noted.     

Fuzzy sets as a basis for a theory of possibility

The theory of possibility described in this paper is related to the theory of fuzzy sets by defining the concept of a possibility distribution as a fuzzy restriction which acts as an elastic constraint on the values that may be assigned to a variable. More specifically, if F is a fuzzy subset of a universe of discourse U = {u} which is characterized by its membership function μ_F, then a proposition of the form $\text{“X}\text{is}\text{F”}$, where X is a variable taking values in U, induces a possibility distribution $\text{t}\text{?}{}_{\mathrm{x}}$ which equates the possibility of X taking the value u to μ_F(u)—the compatibility of u with F. In this way, X becomes a fuzzy variable which is associated with the possibility distribution $\text{t}\text{?}{}_{\mathrm{x}}$ in much the same way as a random variable is associated with a probability distribution. In general, a variable may be associated both with a possibility distribution and a probability distribution, with the weak connection between the two expressed as the possibility/probability consistency principle.A thesis advanced in this paper is that the imprecision that is intrinsic in natural languages is, in the main, possibilistic rather than probabilistic in nature. Thus, by employing the concept of a possibility distribution, a proposition, p, in a natural language may be translated into a procedure which computes the probability distribution of a set of attributes which are implied by p. Several types of conditional translation rules are discussed and, in particular, a translation rule for propositions of the form $\text{“X}\text{is}\text{F}$ is α-possible”, where α is a number in the interval [0,1], is formulated and illustrated by examples.     

The mirror property of metric 2-projection

The concept of a mirror selection of a metric 2-projection is introduced (the metric 2-projection of two elements x ₁, x ₂ of a Banach space onto its subspace Y consists of all elements y ∈ Y such that the length of the broken line x ₁ yx ₂ is minimal). It is proved that the existence of the mirror selection of a metric 2-projection onto eny subspace having a prescribed dimension or codimension is a characteristic property of a Hilbert space. A relation between the mirror selection of a metric 2-projection and the central selection of the usual metric projection is pointed out.     

The Bloch Approximation in Periodically Perforated Media

We consider a periodically heterogeneous and perforated medium filling an open domain Ω of ℝ^N. Assuming that the size of the periodicity of the structure and of the holes is O(ε), we study the asymptotic behavior, as ε → 0, of the solution of an elliptic boundary value problem with strongly oscillating coefficients posed in Ω^ε (Ω^ε being Ω minus the holes) with a Neumann condition on the boundary of the holes. We use Bloch wave decomposition to introduce an approximation of the solution in the energy norm which can be computed from the homogenized solution and the first Bloch eigenfunction. We first consider the case where Ωis ℝ^N and then localize the problem for a bounded domain Ω, considering a homogeneous Dirichlet condition on the boundary of Ω.     

Towards variational analysis in metric spaces: metric regularity and fixed points

The main results of the paper include (a) a theorem containing estimates for the surjection modulus of a “partial composition” of set-valued mappings between metric spaces which contains as a particlar case well-known Milyutin’s theorem about additive perturbation of a mapping into a Banach space by a Lipschitz mapping; (b) a “double fixed point” theorem for a couple of mappings, one from X into Y and another from Y to X which implies a fairly general version of the set-valued contraction mapping principle and also a certain (different) version of the first theorem.     

Bounds on the number of switchings for trajectories of piecewise analytic vector fields

We study the trajectories of systems $\text{x}\text{?}\text{= X(x)}$, where X is a continuous “extendably piecewise analytic” vector field, i.e., a continuous vector field X such that the domain of ? admits a locally finite partition $\text{I}$ into sets such that for each A ∈ $\text{I}$ there is a vector field X_A which is analytic on a neighborhood of the closure of A and whose restriction to A coincides with that of X. We prove that the trajectories are piecewise analytic, with a priori bounds on the number of switchings for all trajectories that stay in a fixed compact set and whose duration does not exceed a fixed number T. This result implies the existence of a regular synthesis for optimal control problems with a strictly convex Lagrangian, and a linear dynamics with polyhedral constraints on the controls.     

Zeta Functions for Curves and Log Canonical Models

The topological zeta function and Igusa's local zeta functionare respectively a geometrical invariant associated to a complexpolynomial f and an arithmetical invariant associated to a polynomialf over a p-adic field. When f is a polynomial in two variables we prove a formula forboth zeta functions in terms of the so-called log canonicalmodel of f^-1{0} in A². This result yields moreover a conceptualexplanation for a known cancellation property of candidate polesfor these zeta functions. Also in the formula for Igusa's localzeta function appears a remarkable non-symmetric ‘q-deformation’of the intersection matrix of the minimal resolution of a Hirzebruch-Jungsingularity. 1991 Mathematics Subject Classification: 32S5011S80 14E30 (14G20)     

Submanifolds Of Maximal Nullity In Symmetric Spaces

A non-totally-geodesic submanifold of relative nullity n — 1 in a symmetric space M is a cylinder over one of the following submanifolds: a surface F ² of nullity 1 in a totally geodesic submanifold N³ ? M locally isometric to S ²(c) × ? or H ²(c) × ?; a submanifold F ^k+1 spanned by a totally geodesic submanifold F ^k(c) of constant curvature moving by a special curve in the isometry group of M; a submanifold F ^k+l of nullity k in a flat totally geodesic submanifold of M; a curve.     

Freeoids: a semi-abstract view on endomorphism monoids of relatively free algebras

A freeoid over a (normally, infinite) set of variables X is defined to be a pair (W, E), where W is a superset of X, and E is a submonoid of W ^W containing just one extension of every mapping X → W. For instance, if W is a relatively free algebra over a set of free generators X, then the pair F(W) := (W, End(W)) is a freeoid. In the paper, the kernel equivalence and the range of the transformation F are characterized. Freeoids form a category; it is shown that the transformation F gives rise to a functor from the category of relatively free algebras to the category of freeoids which yields a concrete equivalence of the first category to a full subcategory of the second one. Also, the concept of a model of a freeoid is introduced; the variety generated by a free algebra W is shown to be concretely equivalent to the category of models of F(W). The sets X, W, and the algebras W may generally be many-sorted.     

A just basis

An old problem of P. Erdös and P. Turán asks whether there is a basisA of order 2 for which the number of representationsn=a+a′, a,a′∈A is bounded. Erd?s conjectured that such a basis does not exist. We answer a related finite problem and find a basis for which the number of representations is bounded in the square mean. Writing σ (n)=|{(a, a ^t ) ∈A ²:a+a′=n}| we prove that there exists a setA of nonnegative integers that forms a basis of order 2 (that is,s(n)≥1 for alln), and satisfies ∑_{n ? N} σ(N)² = O(N).     

Bass-Tits minimization of automata, quotients of trees and diameters

Let X be a tree and let G=Aut(X), Bass and Tits have given an algorithm to construct the ‘ultimate quotient’ of X by G starting with any quotient of X, an ‘edge-indexed’ graph. Using a sequence of integers that we compute at consecutive steps of the Bass-Tits (BT) algorithm, we give a lower bound on the diameter of the ultimate quotient of a tree by its automorphism group. For a tree X with finite quotient, this gives a lower bound on the minimum number of generators of a uniform X-lattice whose quotient graph coincides with G?X. This also gives a criterion to determine if the ultimate quotient of a tree is infinite. We construct an edge-indexed graph (A,i) for a deterministic finite state automaton and show that the BT algorithm for computing the ultimate quotient of (A,i) coincides with state minimizing algorithm for finite state automata. We obtain a lower bound on the minimum number of states of the minimized automaton. This gives a new proof that language for the word problem in a finitely generated group is regular if and only if the group is finite, and a new proof that the language of the membership problem for a subgroup is regular if and only if the subgroup has finite index.     

A new algorithm for minimizing convex functions over convex sets

Let be a convex set for which there is an oracle with the following property. Given any pointz∈ℝ ⁿ the oracle returns a “Yes” ifz∈S; whereas ifz∉S then the oracle returns a “No” together with a hyperplane that separatesz fromS. The feasibility problem is the problem of finding a point inS; the convex optimization problem is the problem of minimizing a convex function overS. We present a new algorithm for the feasibility problem. The notion of a volumetric center of a polytope and a related ellipsoid of maximum volume inscribable in the polytope are central to the algorithm. Our algorithm has a significantly better global convergence rate and time complexity than the ellipsoid algorithm. The algorithm for the feasibility problem easily adapts to the convex optimization problem.     

Paths and tableaux descriptions of Jacobi-Trudi determinant associated with quantum affine algebra of type <Emphasis Type="Italic">D</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>

We study the Jacobi-Trudi-type determinant which is conjectured to be the q-character of a certain, in many cases irreducible, finite-dimensional representation of the quantum affine algebra of type D _n . Unlike the A _n and B _n cases, a simple application of the Gessel-Viennot path method does not yield an expression of the determinant by a positive sum over a set of tuples of paths. However, applying an additional involution and a deformation of paths, we obtain an expression by a positive sum over a set of tuples of paths, which is naturally translated into the one over a set of tableaux on a skew diagram.     

Geometry of 2 × 2 hermitian matrices

LetD be a division ring which possesses an involution a → α . Assume that is a proper subfield ofD and is contained in the center ofD. It is pointed out that ifD is of characteristic not two, D is either a separable quadratic extension of F or a division ring of generalized quaternions over F and that if D is of characteristic two,D is a separable quadratic extension ofF. Thus the trace map Tr:D → F, a → a + a is always surjective, which is formerly posed as an assumption in the fundamental theorem of n×n hermitian matrices overD when n ≥ 3 and now can be deleted. WhenD is a field, the fundamental theorem of 2 × 2 hermitian matrices overD has already been proved. This paper proves the fundamental theorem of 2×2 hermitian matrices over any division ring of generalized quaternions of characteristic not two This research was completed during a visit to the Academy of Mathematics and System Sciences, Chinese Academy of Sciences.     

Tambarization of a Mackey functor and its application to the Witt–Burnside construction

For an arbitrary group G, a (semi-)Mackey functor is a pair of covariant and contravariant functors from the category of G-sets, and is regarded as a G-bivariant analog of a commutative (semi-)group. In this view, a G-bivariant analog of a (semi-)ring should be a (semi-)Tambara functor. A Tambara functor is firstly defined by Tambara, which he called a TNR-functor, when G is finite. As shown by Brun, a Tambara functor plays a natural role in the Witt–Burnside construction.It will be a natural question if there exist sufficiently many examples of Tambara functors, compared to the wide range of Mackey functors. In the first part of this article, we give a general construction of a Tambara functor from any Mackey functor, on an arbitrary group G. In fact, we construct a functor from the category of semi-Mackey functors to the category of Tambara functors. This functor gives a left adjoint to the forgetful functor, and can be regarded as a G-bivariant analog of the monoid-ring functor.In the latter part, when G is finite, we investigate relations with other Mackey-functorial constructions — crossed Burnside ring, Elliott?s ring of G-strings, Jacobson?s F-Burnside ring — all these lead to the study of the Witt–Burnside construction.     

Approximating Minimum-Weight Triangulations in Three Dimensions

Let S be a set of noncrossing triangular obstacles in R ³ with convex hull H . A triangulation T of H is compatible with S if every triangle of S is the union of a subset of the faces of T. The weight of T is the sum of the areas of the triangles of T. We give a polynomial-time algorithm that computes a triangulation compatible with S whose weight is at most a constant times the weight of any compatible triangulation. One motivation for studying minimum-weight triangulations is a connection with ray shooting. A particularly simple way to answer a ray-shooting query (``Report the first obstacle hit by a query ray') is to walk through a triangulation along the ray, stopping at the first obstacle. Under a reasonably natural distribution of query rays, the average cost of a ray-shooting query is proportional to triangulation weight. A similar connection exists for line-stabbing queries (``Report all obstacles hit by a query line'). Received February 3, 1997, and in revised form August 21, 1998.     

Subdivision Extendibility

Let H be a multigraph and G a graph containing a subgraph isomorphic to a subdivision of H, with S ⊂ V(G) (the ground set) the image of V(H) under the isomorphism. We consider connectivity and minimum degree or degree sum conditions sufficient to imply there is a spanning subgraph of G isomorphic to a subdivision of H on the same ground set S. These results generalize a number of theorems in the literature.     

The geometry of k-transvection groups

Let k be a (commutative) field and G a group, then a conjugacy class of Abelian subgroups of G is called a class of k-transvection subgroups in G if and only if it generates G and any two elements of the class either commute or are full unipotent subgroups of the group they generate and which is isomorphic to (P)SL₂(k).In this paper we study the geometry of k-transvection groups. Given a class of k-transvection groups Σ, we consider a partial linear space whose points are the elements of Σ, and whose lines correspond to the groups generated by two noncommuting elements from Σ. We derive several properties of this partial linear space. These properties are used to give a characterization of the geometries of k-transvection groups and provide a classification of groups generated by k-transvection subgroups.