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

Lattice Ordered Polynomial Algebras

In this paper we define a lattice order on a set F of binary functions. We then provide necessary and sufficient conditions for the resulting algebra F to be a distributive lattice or a Boolean algebra. We also prove a Cayley theorem for distributive lattices by showing that for every distributive lattice , there is an algebra F of binary functions, such that is isomorphic to F and we show that F is a distributive lattice iff the operations and are idempotent and cummutative, showing that this result cannot be generalized to non-distributive lattices or quasilattices without changing the definitions of and . We also examine the equational properties of an Algebra for which , now defined on the set of binary -polynomials is a lattice or Boolean algebra.     

The symbols of a Frechet algebra of pseudodifferential operators on a polycylinder

H. O. Cordes investigated a C^*-algebra C of singular integral operators on a polycylinder =ⁿ×B and defined symbol homomorphisms where is a certain compact space, and C_x is the Laplace comparison algebra of the compact space B (cf. [2]). We give a characterization of the Frechet algebra CC obtained as the closure of a certain algebra of dos in the topology generated by all H^S norms. We define B:L(H^S)L(H^S)(S) by analogy with [4, 7] and prove that B maps C into C continuously. As a corollary we get , generalizing surjectivity results from [4] and [7]. It seems that no characterization of (C) is known, but it is clear that where is the Frechet algebra studied in [1] and [7].     

Codings of graphs with binary edge labels

LetG(V,E) be a graph. A mappingf:E{0,1} ^m is called a (binary) coding ofG, if the induced mapping , assigns different vectors to the vertices. For the Boolean sum,f is called aB-code, and for the mod 2 sum anM-code. Letm _B (G) resp.m _M (G) be the smallest lengthm for whichB-codes resp.M-codes are possible. Trivially,m _B (G),m _M (G) log₂|V|. Improving results of Z. Tuza we showm _B (G)log₂|V| + 1,m _M (G)log₂|V|+4.     

A Generalization of the Hausdorff-Young Theorem

Considering mixed-norm sequence spaces lp,q, p, q 1, C. N. Kellogg proved the following theorem: if 1 < p 2 then lp,2 and lp,2 , where 1/p + 1/p = 1. This result extends the Hausdorff-Young Theorem.We introduce here multiple mixed-norm sequence spaces , examine their properties and characterize the multipliers of spaces of the form lp,[s;n],q, with the index s repeated n times. By an interpolation-type argument we prove that (l,[2;n],2, lp,[1;n],1) for 1 < p 2. Using these results we obtain a further generalization of the Hausdorff-Young Theorem: if 1 < p 2 then lp,[2;n] and lp,[2;n] for each n = 0, 1, 2, ¨. The spaces lp,[2;n] decrease and lp,[2;n] increase properly with n for 1 < p < 2 and 1/p + 1/p = 1. We also extend a theorem of J. H. Hedlund on multiplers of Hardy spaces and deduce other results.     

Comparison results in a class of reaction-diffusion problems

In this paper pointwise bounds for the solutionsu (x, t) of some reaction-diffusion problems are derived. They are of the form wherez (t) is the solution of the associated kinetic equation and (x, t) is the solution of a pure diffusion problem.

---

Zusammenfassung In der vorliegenden Arbeit werden punktweise Schranken für die Lösungenu (x, t) gewisser Reaktions-Diffusions-Probleme hergeleitet. Sie haben die Form wobeiz (t) die Lösung der zugehörigen kinetischen Gleichung und (x, t) die Lösung eines reinen Diffusionsproblems ist.

     

The number of contractible edges in 3-connected graphs

An edge of a 3-connected graph is calledcontractible if its contraction results in a 3-connected graph. Ando, Enomoto and Saito proved that every 3-connected graph of order at least five has |G|/2 or more contractible edges. As another lower bound, we prove that every 3-connected graph, except for six graphs, has at least (2|E(G)| + 12)/7 contractible edges. We also determine the extremal graphs. Almost all of these extremal graphsG have more than |G|/2 contractible edges.     

Spherical elastic-plastic waves

Zusammenfassung Es wird die Fortpflanzung elastisch-plastischer Spannungswellen in einem unendlichen Medium betrachtet, welches einer idealen Spannungs-Verformungs-Kurve folgt, Trescas Fliesskriterium unterworfen ist und einen sphärischen Hohlraum enthält, wobei an der Fläche des Hohlraumes ein Stoss angenommen wird. Ein rechnerisches Verfahren, basiert auf endliche Differenzen, wird entwickelt and ein Beispiel gegeben.

---

Notation radial stress - tangential stress - K yield stress - _rr non-dimensional radial stress ( /K) - non-dimensional tangential stress ( /K) - , Lame's constants - K _b Bulk constant (=(3+2)/3) - v Poisson's constant - Material density - C Elastic wave velocity (=((+2)/)^1/2) - C _p Plastic wave velocity (=(K _b /)^1/2) - distance from center of cavity - r ₀ cavity radius - v non-dimensional radial co-ordinate (= /r ₀) - time - t non-dimensional time (=C /r ₀) - radial displacement - u non-dimensional radial displacement (=/r ₀) - particle velocity - v non-dimensional particle velocity (= /C) - pressure - P(t) non-dimensional pressure (= /K)     

On a problem of B. I. Golubov

. . . : s_n(x) — , _n-(, 1)- n L ². , . , : a _k l ² _n () [0,1] , (*) , (**) . a _k l ² u _n () [0,1] , (**), (*) .     

Infinitesimal obstructions to weakly mixing

Let ^t be the flow (parametrized with respect to arc length) of a smooth unit vector field v on a closed Riemannian manifold M ⁿ , whose orbits are geodesics. Then the (n-1)-plane field normal to v, v, is invariant under d ^t and, for each x M, we define a smooth real function _x (t) : (1 + _i (t)), where the _i(t) are the eigenvalues of AA ^T, A being the matrix (with respect to orthonormal bases) of the non-singular linear map d^2t , restricted to v at the point _x ^-t M ⁿ.Among other things, we prove the Theorem (Theorem II, below). Assume v is also volume preserving and that _x ^' (t) 0 for all x M and real t; then, if _x ^t : M M is weakly missng for some t, it is necessary that vx 0 at all x M.     

Convergence des solutions formelles de certaines équations fonctionnelles

Résumé Soitq un nombre algébrique de module 1, qui ne soit pas une racine de l'unité, etP [X, Y ₀,Y ₁] un polynôme non nul. Dans cet article, nous montrons que toute solution de l'équation fonctionnelleP(z, (z), (qz))=0, qui est une série formelle (z) dansQ[[z]], a un rayon de convergence non nul.

---

Summary Letq Q be an algebraic number of modulus one that is not a root of unity. LetP Q[X, Y ₀,Y ₁] be a non zero polynomial. In this paper, we show that every formal power series,(z) Q[[z]], solution of the functional equationP(z), (z), (qz)) = 0 has a non zero radius of convergence.

     

The normal subgroup lattice of 2-transitive automorphism groups of linearly ordered sets

Using combinatorial and model-theoretic means, we examine the structure of normal subgroup lattices N(A()) of 2-transitive automorphism groups A() of infinite linearly ordered sets (, ). Certain natural sublattices of N(A()) are shown to be Stone algebras, and several first order properties of their dense and dually dense elements are characterized within the Dedekind-completion of (, ). As a consequence, A() has either precisely 5 or at least 2²¹ (even maximal) normal subgroups, and various other group- and lattice-theoretic results follow.     

χ-Embeddings of ordered sets

We use the technique of -Embeddings to study retracts and varieties of ordered sets. We investigate the class of all ordered sets which are retract of every ordered set in which is -Embedded.     

Maximal inequalities,convexity inequality,and their duality. II

, , . . . [1], , . , , ., , L logL. , , . . . . [5]. , .     

Kato's equality and spectral decomposition for positive C0-groups

Let A be the generator of a C₀-semigroup {T(t); t0} defined on a Banach lattice E. It is shown that T(t) is a lattice homomorphism for all t>0 if and only if A satisfies <¦x¦, Ax>= (xD(A), x D(A)) (where q: EE is the evaluation mapping). This equality is used to obtain a spectral decomposition for generators of positive groups.     

Über die Riemannsche Einbettungsgeometrie der Veronesemannigfaltigkeiten

Let E be a n-dimensional euclidean vector space. The subset V _k ⁿ ={x ... x | x E} of ^kE is called a Veronesemanifold. The scalar product of E induces a euclidean structure on ^kE. Passing to the corresponding projective space , one may consider as a riemannian submanifold of the space form . In this paper we study properties of the pair of riemannian manifolds.     

Sharp Nikolskii inequalities with exponential weights

w _a(x)=exp(–x^a), xR, a0. , N _n (a,p,q) — (2), _n P _nw_ap, CN_n(a,p, q)P_nw_aq. , — , {P _n}, .

---

---

This material is based upon research supported by the National Science Foundation under Grant No. DMS-84-19525, by the United States Information Agency under Senior Research Fulbright Grant No. 85-41612, and by the Hungarian Ministry of Education (first author). The work was started while the second author visited The Ohio State University between 1983 and 1985, and it was completed during the first author's visit to Hungary in 1985.     

A generalization ofH μ-spaces and Hankel transforms

-H _,M,a H _,b . - — H _,M H . . , H ,–1/2, H _,H,a H ^,1/a H _,M H . , .     

Canonical Ordering Trees and Their Applications in Graph Drawing

We study the properties of Schnyders realizers and canonical ordering trees of plane graphs. Based on these newly discovered properties, we obtain compact drawings of two styles for any plane graph G with n vertices. First, we show that G has a visibility representation with height at most 15n/16 . This improves the previous best bound of (n - 1). Second, we show that every plane graph G has a straight-line grid embedding on an (n - ₀ - 1) × (n - ₀ - 1) grid, where ₀ is the number of cyclic faces of G with respect to its minimum realizer. This improves the previous best bound of (n - 1) × (n - 1). We also study the properties of the regular edge labeling of 4-connected plane triangulation. Based on these properties, we show that every such a graph has a canonical ordering tree with at most (n + 1)/2 leaves. This improves the previously known bound of (2n + 1)/3 . We show that every 4-connected plane graph has a visibility representation with height at most 3n/4 . All drawings discussed in this paper can be obtained in linear time.     

Estimate of the modulus of continuity of the generalized solutions of certain singular parabolic equations

One considers singular parabolic equations of the form (u)/t–u0,where sign u is a multivalued function, equal to -I for u<0, to 1 for u>0, and to the segment [-I,I] for u=0. Such a class of equations contains, in particular, the model for the two-phase Stefan problem, the porous medium equation, and the plasma equation. For the bounded generalized solutions u(x,t) of the indicated equations (without the assumption u/L²one has established a qualified local estimate of the modulus of continuity.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Ins'tituta im. V. A. Steklova AN SSSR, Vol. 147, pp. 49–71, 1985.