Efficient Regular Polygon Dissections

We study the minimum number g(m,n) (respectively, p(m,n)) of pieces needed to dissect a regular m-gon into a regular n-gon of the same area using glass-cuts (respectively, polygonal cuts). First we study regular polygon-square dissections and show that n/2 -2 g(4,n) (n/2) + o(n) and n/4 g(n,4) (n/2) + o(n) hold for sufficiently large n. We also consider polygonal cuts, i.e., the minimum number p(4,n) of pieces needed to dissect a square into a regular n-gon of the same area using polygonal cuts and show that n/4 p(4,n) (n/2) + o(n) holds for sufficiently large n. We also consider regular polygon-polygon dissections and obtain similar bounds for g(m,n) and p(m,n).     

First Alexandroff Decomposition Theorem for Topological Lattice Group Valued Measures

Let (X, F) be an Alexandroff space, let A(F) be the Boolean subalgebra of 2 ^X generated by F, let G be a Hausdorff commutative topological lattice group and let rba_F(A(F), G) denote the set of all order bounded F-inner regular finitely additive set functions from A(F) into G. Using some special properties of the elements of rba_F(A(F), G), we extend to this setting the first decomposition theorem of Alexandroff.     

Strongly Regular Graphs and Designs with Three Intersection Numbers

We investigate BIBDs with three intersection numbers,x, y, and z, such that the relation on the block set given byA B iff the cardinality of the intersectionof A and B is not equal to x is an equivalence relation. Withsuch a design, we associate a family of strongly regular graphswith the same parameters. Two constructions producing infinitefamilies of such designs are given.     

Minimum Distance Bounds for s-Regular Codes

A code C F ⁿ is s-regular provided, forevery vertex x F ⁿ, if x is atdistance at most s from C then thenumber of codewords y C at distance ifrom x depends only on i and the distancefrom x to C. If denotesthe covering radius of C and C is -regular,then C is said to be completely regular. SupposeC is a code with minimum distance d,strength t as an orthogonal array, and dual degrees ^*. We prove that d 2t + 1 whenC is completely regular (with the exception of binaryrepetition codes). The same bound holds when C is(t + 1)-regular. For unrestricted codes, we show thatd s ^* + t unless C is a binary repetitioncode.     

Compactifying sufficiently regular covering spaces of compact 3-manifolds

In this paper it is proven that if the group of covering translations of the covering space of a compact, connected, -irreducible 3-manifold corresponding to a non-trivial, finitely-generated subgroup of its fundamental group is infinite, then either the covering space is almost compact or the subgroup is infinite cyclic and has normalizer a non-finitely-generated subgroup of the rational numbers. In the first case additional information is obtained which is then used to relate Thurston's hyperbolization and virtual bundle conjectures to some algebraic conjectures about certain 3-manifold groups.     

Open subgroups of

Let be a locally compact group and let denote the -algebra generated by left translation operators on . Let and be the spaces of almost periodic and weakly almost periodic functionals on the Fourier algebra , respectively. It is shown that if contains an open abelian subgroup, then (1) if and only if is norm dense in ; (2) is a -algebra if is norm dense in , where denotes the set of elements in with compact support. In particular, for any amenable locally compact group which contains an open abelian subgroup, has the dual Bohr approximation property and is a -algebra.

     

Are covering (enveloping) morphisms minimal?

We prove that for certain classes of modules such that direct sums of -covers ( -envelopes) are -covers ( -envelopes), -covering ( -enveloping) homomorphisms are always right (left) minimal. As a particular case we see that over noetherian rings, essential monomorphisms are left minimal. The same type of results are given when direct products of -covers are -covers. Finally we prove that over commutative noetherian rings, any direct product of flat covers of modules of finite length is a flat cover.     

ERM learning with unbounded sampling

The learning approach of empirical risk minimization (ERM) is taken for the regression problem in the least square framework. A standard assumption for the error analysis in the literature is the uniform boundedness of the output sampling process. In this paper we abandon this boundedness assumption and conduct error analysis for the ERM learning algorithm with unbounded sampling processes satisfying an increment condition for the moments of the output. The key novelty of our analysis is a covering number argument for estimating the sample error.     

On locally convex hypersurfaces in Hadamard manifolds

Locally convex compact hypersurfaces immersed in a hollow simply connected Riemannian space of nonpositive sectional curvature are considered. They are proved to be convex hypersurfaces homeomorphic to the sphere. A similar result for immersed hypersurfaces with nonpositive definite second quadratic form of rank no smaller than one is obtained. Translated fromMatematicheskie Zametki, Vol. 67, No. 4, pp. 498–507, April, 2000.     

The Positivity of Intersection Multiplicities and Symbolic Powers of Prime Ideals

Serre's nonnegativity conjecture for intersection multiplicities has recently been proven by O. Gabber. In this paper we investigate Serre's positivity conjecture using the methods which he developed. We show in particular that the positivity conjecture has implications for properties of symbolic powers of prime ideals in regular local rings.