Mixed multiplicities and the minimal number of generator of modules

Let (R,m) be a d-dimensional Noetherian local ring. In this work we prove that the mixed Buchsbaum-Rim multiplicity for a finite family of R-submodules of R^p of finite colength coincides with the Buchsbaum-Rim multiplicity of the module generated by a suitable superficial sequence, that is, we generalize for modules the well-known Risler-Teissier theorem. As a consequence, we give a new proof of a generalization for modules of the fundamental Rees’ mixed multiplicity theorem, which was first proved by Kirby and Rees in (1994, [8]). We use the above result to give an upper bound for the minimal number of generators of a finite colength R-submodule of R^p in terms of mixed multiplicities for modules, which generalize a similar bound obtained by Cruz and Verma in (2000, [5]) for m-primary ideals.     

Representation of the inverse of a frame multiplier

Certain mathematical objects appear in a lot of scientific disciplines, like physics, signal processing and, naturally, mathematics. In a general setting they can be described as frame multipliers, consisting of analysis, multiplication by a fixed sequence (called the symbol), and synthesis. In this paper we show a surprising result about the inverse of such operators, if any, as well as new results about a core concept of frame theory, dual frames. We show that for semi-normalized symbols, the inverse of any invertible frame multiplier can always be represented as a frame multiplier with the reciprocal symbol and dual frames of the given ones. Furthermore, one of those dual frames is uniquely determined and the other one can be arbitrarily chosen. We investigate sufficient conditions for the special case, when both dual frames can be chosen to be the canonical duals. In connection to the above, we show that the set of dual frames determines a frame uniquely. Furthermore, for a given frame, the union of all coefficients of its dual frames is dense in ?²${?}^2$. We also introduce a class of frames (called pseudo-coherent frames), which includes Gabor frames and coherent frames, and investigate invertible pseudo-coherent frame multipliers, allowing a classification for frame-type operators for these frames. Finally, we give a numerical example for the invertibility of multipliers in the Gabor case.     

Decidability of a portion of the predicate calculus

We show decidability of the existence of a model (a finite model) for sentences with the string of quantifiers ∀x(∃y ₁...y _n), for a language with equality, one one-place function, predicates and constants. I would like to thank the Israel Academy of Science and Humanities for partially supporting this research by a grant.     

Depths of Powers of the Edge Ideal of a Tree

Lower bounds are given for the depths of R/I ^t for t ≥ 1 when I is the edge ideal of a tree or forest. The bounds are given in terms of the diameter of the tree, or in case of a forest, the largest diameter of a connected component and the number of connected components. These lower bounds provide a lower bound on the power for which the depths stabilize.     

Rigidity of harmonic maps of maximum rank

Thehomotopical rank of a mapf:M →N is, by definition, min{dimg(M) ¦g homotopic tof}. We give upper bounds for this invariant whenM is compact Kähler andN is a compact discrete quotient of a classical symmetric space, e.g., the space of positive definite matrices. In many cases the upper bound is sharp and is attained by geodesic immersions of locally hermitian symmetric spaces. An example is constructed (Section 9) to show that there do, in addition, exist harmonic maps of quite a different character. A byproduct is construction of an algebraic surface with large and interesting fundamental group. Finally, a criterion for lifting harmonic maps to holomorphic ones is given, as is a factorization theorem for representations of the fundamental group of a compact Kähler manifold. The technique for the main result is a combination of harmonic map theory, algebra, and combinatorics; it follows the path pioneered by Siu in his ridigity theorem and later extended by Sampson.     

On Dehn Functions of Infinite Presentations of Groups

We introduce two new types of Dehn functions of group presentations which seem more suitable (than the standard Dehn function) for infinite group presentations and prove the fundamental equivalence between the solvability of the word problem for a group presentation defined by a decidable set of defining words and the property of being computable for one of the newly introduced functions (this equivalence fails for the standard Dehn function). Elaborating on this equivalence and making use of this function, we obtain a characterization of finitely generated groups for which the word problem can be solved in nondeterministic polynomial time. We also give upper bounds for these functions, as well as for the standard Dehn function, for two well-known periodic groups. In particular, we prove that the (standard) Dehn function of a 2-group Γ of intermediate growth, defined by a system of defining relators due to Lysenok, is bounded from above by C₁x² log₂ x, where C₁ > 1 is a constant. We also show that the (standard) Dehn function of a free m-generator Burnside group B(m, n) of exponent n ≥ 2⁴⁸, where n is either odd or divisible by 2⁹, defined by a minimal system of defining relators, is bounded from above by the subquadratic function x^19/12. Received: September 2007, Revision: March 2008, Accepted: March 2008     

Excess of a class of g-frames

In this paper, we study the relationship between frames for the super Hilbert space H⊕H and g-frames for H with respect to C². We show that a g-frame associated with a frame for H⊕H remains a g-frame whenever any one of its elements is removed. Furthermore, we show that the excess of such a g-frame is at least dimH.     

On the convergence of sequences of stationary jump Markov processes

This paper presents two main results: first, a Liapunov type criterion for the existence of a stationary probability distribution for a jump Markov process; second, a Liapunov type criterion for existence and tightness of stationary probability distributions for a sequence of jump Markov processes. If the corresponding semigroups T_N(t) converge, under suitable hypotheses on the limit semigroup, this last result yields the weak convergence of the sequence of stationary processes (T_N(t), π_N) to the stationary limit one.     

Puintuplication of Room squares

Given a strong starter for a groupG of ordern, where 3 does not dividen, a construction is given for a strong starter for the direct sum ofG and the integers modulo 5. In particular, this gives a Room square of side 5p for all non-Fermat primesp.     

Non-wandering sets of the powers of maps of a tree

Let T be a tree and let Ω ( f ) be the set of non-wandering points of a continuous map f: T→ T. We prove that for a continuous map f: T→ T of a tree T: ( i) if x∈ Ω( f) has an infinite orbit, then x∈ Ω( fⁿ) for each n∈ ℕ; (ii) if the topological entropy of f is zero, then Ω( f) = Ω( fⁿ) for each n∈ ℕ. Furthermore, for each k∈ ℕ we characterize those natural numbers n with the property that Ω(f^k) = Ω(f^kn) for each continuous map f of T.     

Differentiation of Singular Integrals with Piecewise-Continuous Density and Boundary Values of Derivatives of a Cauchy-Type Integral

We establish sufficient conditions for the differentiability of a singular Cauchy integral with piecewise-continuous density. Formulas for the nth-order derivatives of a singular Cauchy integral and for the boundary values of the nth-order derivatives of a Cauchy-type integral are obtained.__________Translated from Ukrains’kyi Matematychnyi Zhurnal, Vol. 57, No. 2, pp. 222–229, February, 2005.     

Linear-time computation of optimal subgraphs of decomposable graphs

A general problem in computational graph theory is that of finding an optimal subgraph H of a given weighted graph G. The matching problem (which is easy) and the traveling salesman problem (which is not) are well-known examples of this general problem. In the literature one can also find a variety of ad hoc algorithms for solving certain special cases in linear time. We suggest a general approach for constructing linear-time algorithms in the case where the graph G is defined by certain rules of composition (as are trees, series-parallel graphs, and outerplanar graphs) and the desired subgraph H satisfies a property that is “regular” with respect to these rules of composition (as do matchings, dominating sets, and independent sets for all the classes just mentioned). This approach is applied to obtain a linear-time algorithm for computing the irredundance number of a tree, a problem for which no polynomial-time algorithm was previously known.     

On equivalence of moduli of smoothness of polynomials in ,

It is well known that for functions , 1p∞. For general functions fL_p, it does not hold for 0<p<1, and its inverse is not true for any p in general. It has been shown in the literature, however, that for certain classes of functions the inverse is true, and the terms in the inequalities are all equivalent. Recently, Zhou and Zhou proved the equivalence for polynomials with p=∞. Using a technique by Ditzian, Hristov and Ivanov, we give a simpler proof to their result and extend it to the L_p space for 0<p∞. We then show its analogues for the Ditzian–Totik modulus of smoothness and the weighted Ditzian–Totik modulus of smoothness for polynomials with .     

On the sum of powers of Laplacian eigenvalues of bipartite graphs

For a bipartite graph G and a non-zero real α, we give bounds for the sum of the αth powers of the Laplacian eigenvalues of G using the sum of the squares of degrees, from which lower and upper bounds for the incidence energy, and lower bounds for the Kirchhoff index and the Laplacian Estrada index are deduced.     

Constancy of p-harmonic maps of finite q-energy into non-positively curved manifolds

We investigate p-harmonic maps, p ≥ 2, from a complete non-compact manifold into a non-positively curved target. First, we establish a uniqueness result for the p-harmonic representative in the homotopy class of a constant map. Next, we derive a Caccioppoli inequality for the energy density of a p-harmonic map and we prove a companion Liouville type theorem, provided the domain manifold supports a Sobolev–Poincaré inequality. Finally, we obtain energy estimates for a p-harmonic map converging, with a certain speed, to a given point.      

Approximation of Sojourn Times of Gaussian Processes

We investigate the tail asymptotic behavior of the sojourn time for a large class of centered Gaussian processes X, in both continuous- and discrete-time framework. All results obtained here are new for the discrete-time case. In the continuous-time case, we complement the investigations of Berman (Commun Pure Appl Math 38(5):519–528, 1985a and Probab Theory Relat Fields 20(1):113–124, 1987) for non-stationary X. A by-product of our investigation is a new representation of Pickands constant which is important for Monte-Carlo simulations and yields a sharp lower bound for Pickands constant.

     

Determination of contact stresses in problems on bending of a package of transversely isotropic bars

A mechanomathematical model for bending of packages of transversely isotropic bars of rectangular cross section is proposed. Adhesion, slippage, and separation zones between the bars are considered. The resolving equations for deflections and tangential displacements are supplemented with a system of linear differential equations for determining the normal and tangential contact stresses, and boundary conditions are formulated. A scheme for analytical solution of two contact problems—a package under the action of a distributed load and a round stamp—is considered. For these packages, a transition is performed from the initial system of differential equations for determining the contact stresses, where the unknown functions are interrelated by recurrent relationships, to one linear differential equation of fourth order and then to a system of linear algebraic equations. This transition allows us to integrate the initial system and get expressions for the contact stresses.Translated from Mekhanika Kompozitnykh Materialov, Vol. 40, No. 6, pp. 761–778, November–December, 2004.     

On the number of primitive representations of integers as sums of squares

Formulas for the number of primitive representations of any integer n as a sum of k squares are given, for 2 ≤ k ≤ 8, and for certain values of n, for 9 ≤ k ≤ 12. The formulas have a similar structure and are striking for their simplicity. Dedicated to Richard Askey on the occasion of his 70th birthday. 2000 Mathematics Subject Classification Primary—11E25; Secondary—05A15, 33E05.     

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.