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.     

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)     

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.     

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.     

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.     

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 Ω.     

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.     

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.     

Pseudo-holomorphic maps and bubble trees

This paper proves a strong convergence theorem for sequences of pseudo-holomorphic maps from a Riemann surface to a symplectic manifoldN with tamed almost complex structure. (These are the objects used by Gromov to define his symplectic invariants.) The paper begins by developing some analytic facts about such maps, including a simple new isoperimetric inequality and a new removable singularity theorem. The main technique is a general procedure for renormalizing sequences of maps to obtain “bubbles on bubbles.” This is a significant step beyond the standard renormalization procedure of Sacks and Uhlenbeck. The renormalized maps give rise to a sequence of maps from a “bubble tree”—a map from a wedge Σ V S² V S² V ... →N. The main result is that the images of these renormalized maps converge in L^1,2 ∪C° to the image of a limiting pseudo-holomorphic map from the bubble tree. This implies several important properties of the bubble tree. In particular, the images of consecutive bubbles in the bubble tree intersect, and if a sequence of maps represents a homology class then the limiting map represents this class.     

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.     

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.     

Remainders in compactifications of topological groups

In this paper, we consider the following question: when does a topological group G have a Hausdorff compactification bG with a remainder belonging to a given class of spaces? We extend the results of A.V. Arhangel'skii by showing that if a remainder of a non-locally compact topological group G has a countable open point-network or a locally Gδ-diagonal, then G and the compactification bG of G are separable and metrizable.     

Total Colorings Of Degenerate Graphs

A total coloring of a graph G is a coloring of all elements of G, i.e. vertices and edges, such that no two adjacent or incident elements receive the same color. A graph G is s-degenerate for a positive integer s if G can be reduced to a trivial graph by successive removal of vertices with degree ≤s. We prove that an s-degenerate graph G has a total coloring with Δ+1 colors if the maximum degree Δ of G is sufficiently large, say Δ≥4s+3. Our proof yields an efficient algorithm to find such a total coloring. We also give a lineartime algorithm to find a total coloring of a graph G with the minimum number of colors if G is a partial k-tree, that is, the tree-width of G is bounded by a fixed integer k.     

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.     

Topological vector spaces, compacta, and unions of subspaces

In the first two sections, we study when a σ-compact space can be covered by a point-finite family of compacta. The main result in this direction concerns topological vector spaces. Theorem 2.4 implies that if such a space L admits a countable point-finite cover by compacta, then L has a countable network. It follows that if f is a continuous mapping of a σ-compact locally compact space X onto a topological vector space L, and fibers of f are compact, then L is a σ-compact space with a countable network (Theorem 2.10). Therefore, certain σ-compact topological vector spaces do not have a stronger σ-compact locally compact topology.In the last, third section, we establish a result going in the orthogonal direction: if a compact Hausdorff space X is the union of two subspaces which are homeomorphic to topological vector spaces, then X is metrizable (Corollary 3.2).     

Some properties of c-covers of a pair of Lie algebras

In [H. Safa and H. Arabyani, On c-nilpotent multiplier and c-covers of a pair of Lie algebras, Commun. Algebra 45(10) (2017), 4429–4434], we characterized the structure of the c-nilpotent multiplier of a pair of Lie algebras in terms of its c-covering pairs and discussed some results on the existence of c-covers of a pair of Lie algebras. In the present paper, it is shown under some conditions that a relative c-central extension of a pair of Lie algebras is a homomorphic image of a c-covering pair. Moreover, we prove that a c-cover of a pair of finite dimensional Lie algebras, under some assumptions, has a unique domain up to isomorphism and also that every perfect pair of Lie algebras admits at least one c-cover. Finally, we discuss a result concerning the isoclinism of c-covering pairs.     

Path coupling without contraction

Path coupling is a useful technique for simplifying the analysis of a coupling of a Markov chain. Rather than defining and analysing the coupling on every pair in Ω×Ω, where Ω is the state space of the Markov chain, analysis is done on a smaller set SΩ×Ω. If the coefficient of contraction β is strictly less than one, no further analysis is needed in order to show rapid mixing. However, if β=1 then analysis (of the variance) is still required for all pairs in Ω×Ω. In this paper we present a new approach which shows rapid mixing in the case β=1 with a further condition which only needs to be checked for pairs in S, greatly simplifying the work involved. We also present a technique applicable when β=1 and our condition is not met.     

The interval function of a connected graph and road systems

Let V be a finite nonempty set. In this paper, a road system on V (as a generalization of the set of all geodesics in a connected graph G with V(G)=V) and an intervaloid function on V (as a generalization of the interval function (in the sense of Mulder) of a connected graph G with V(G)=V) are introduced. A natural bijection of the set of all intervaloid functions on V onto the set of all road systems on V is constructed. This bijection enables to deduce an axiomatic characterization of the interval function of a connected graph G from a characterization of the set of all geodesics in G.