Zero Products of Toeplitz Operators with <Emphasis Type="Italic">n</Emphasis>-Harmonic Symbols

On the Bergman space of the unit polydisk in the complex n-space, we solve the zero-product problem for two Toeplitz operators with n-harmonic symbols that have local continuous extension property up to the distinguished boundary. In the case where symbols have additional Lipschitz continuity up to the whole distinguished boundary, we solve the zero-product problem for products with four factors. We also prove a local version of this result for products with three factors.     

Zero products of Toeplitz operators with harmonic symbols

On the Bergman space of the unit ball in Cⁿ, we solve the zero-product problem for two Toeplitz operators with harmonic symbols that have continuous extensions to (some part of) the boundary. In the case where symbols have Lipschitz continuous extensions to the boundary, we solve the zero-product problem for multiple products with the number of factors depending on the dimension n of the underlying space; the number of factors is n+3. We also prove a local version of this result but with loss of a factor.     

On the Dirichlet problem for the prescribed mean curvature equation over general domains

We study and solve the Dirichlet problem for graphs of prescribed mean curvature in Rn+1 over general domains Ω without requiring a mean convexity assumption. By using pieces of nodoids as barriers we first give sufficient conditions for the solvability in case of zero boundary values. Applying a result by Schulz and Williams we can then also solve the Dirichlet problem for boundary values satisfying a Lipschitz condition.     

Analytic extension and reconstruction of obstacles from few measurements for elliptic second order operators

We deal with an inverse obstacle problem for general second order scalar elliptic operators with real principal part and analytic coefficients near the obstacle. We assume that the boundary of the obstacle is a non-analytic hypersurface. We show that, when we put Dirichlet boundary conditions, one measurement is enough to reconstruct the obstacle. In the Neumann case, we have results only for n = 2, 3 in general. More precisely, we show that one measurement is enough for n = 2 and we need 3 linearly independent inputs for n = 3. However, in the case for the Helmholtz equation, we only need n ? 1 linearly independent inputs, for any n ≥ 2. Here n is the dimension of the space containing the obstacle. These are justified by investigating the analyticity properties of the zero set of a real analytic function. In addition, we give a reconstruction procedure for each case to recover the shape of obstacle. Although we state the results for the scattering problems, similar results are true for the associated boundary value problems.     

The \bar \partial -problem on q-pseudoconvex domains with applications

For a q-pseudoconvex domain Ω in ? ⁿ , 1 ≤ q ≤ n, with Lipschitz boundary, we solve the $\bar \partial $ -problem with exact support in Ω. Moreover, we solve the $\bar \partial $ -problem with solutions smooth up to the boundary over Ω provided that it has smooth boundary. Applications are given to the solvability of the tangential Cauchy-Riemann equations on the boundary.     

On the n-dimensional Dirichlet problem for isometric maps

We exhibit explicit Lipschitz maps from Rn to Rn which have almost everywhere orthogonal gradient and are equal to zero on the boundary of a cube. We solve the problem by induction on the dimension n.     

<Emphasis Type="Italic">n</Emphasis>-fold Fourier series expansion in root functions of a differential pencil with <Emphasis Type="Italic">n</Emphasis>-fold multiple characteristic

On a finite interval, we consider a parametric differential pencil of the singular irregular type with an n-fold multiple characteristic and with boundary conditions all of which except for the last are posed at the left end of the interval. We solve the problem on the n-fold expansion of n arbitrary functions in series in Keldysh derived chains of eigenfunctions and associated functions (root functions) of the pencil.     

Compact Toeplitz operators on the Segal-Bargmann space

In this note, we show that Miao and Zheng's characterization of compact operators on the Bergman space of the unit disk that are finite sums of finite products of Toeplitz operators (with each one of the symbols belonging to BT) also holds for the Segal-Bargmann space of Cn.     

Global regularity for solutions to Dirichlet problem for discontinuous elliptic systems with nonlinearity q > 1 and with natural growth

In this paper we deal with the Hölder regularity up to the boundary of the solutions to a nonhomogeneous Dirichlet problem for second-order discontinuous elliptic systems with nonlinearity q > 1 and with natural growth. The aim of the paper is to clarify that the solutions of the above problem are always global Hölder continuous in the case of the dimension n = q without any kind of regularity assumptions on the coefficients. As a consequence of this sharp result, the singular sets $\Omega_0 \subset \OmegaIn this paper we deal with the H?lder regularity up to the boundary of the solutions to a nonhomogeneous Dirichlet problem for second-order discontinuous elliptic systems with nonlinearity q > 1 and with natural growth. The aim of the paper is to clarify that the solutions of the above problem are always global H?lder continuous in the case of the dimension n = q without any kind of regularity assumptions on the coefficients. As a consequence of this sharp result, the singular sets , are always empty for n = q. Moreover we show that also for 1 < q < 2, but q close enough to 2, the solutions are global H?lder continuous for n = 2.      

Periodic products of groups

In this paper we provide an overview of the results relating to the n-periodic products of groups that have been obtained in recent years by the authors of the present paper, as well as some results obtained by other authors in this direction. The periodic products were introduced by S.I. Adian in 1976 to solve the Maltsev’s well-known problem. It was shown that the periodic products are exact, associative and hereditary for subgroups. They also possess some other important properties such as the Hopf property, the C*-simplicity, the uniform non-amenability, the SQ-universality, etc. It was proved that the n-periodic products of groups can uniquely be characterized by means of certain quite specific and simply formulated properties. These properties allow to extend to n-periodic products of various families of groups a number of results previously obtained for free periodic groups B(m, n). In particular,we describe the finite subgroups of n-periodic products, Also, we analyze and extend the simplicity criterion of n-periodic products obtained previously by S.I. Adian.     

The backup 2-median problem on block graphs

The backup 2-median problem is a location problem to locate two facilities at vertices with the minimum expected cost where each facility may fail with a given probability. Once a facility fails, the other one takes full responsibility for the services. Here we assume that the facilities do not fail simultaneously. In this paper, we consider the backup 2-median problem on block graphs where any two edges in one block have the same length and the lengths of edges on different blocks may be different. By constructing a tree-shaped skeleton of a block graph, we devise an O（n log n q- m）-time algorithm to solve this problem where n and m are the number of vertices and edges, respectively, in the given block graph.     

Paired domination on interval and circular-arc graphs

We study the paired-domination problem on interval graphs and circular-arc graphs. Given an interval model with endpoints sorted, we give an O(m+n) time algorithm to solve the paired-domination problem on interval graphs. The result is extended to solve the paired-domination problem on circular-arc graphs in O(m(m+n)) time.     

How to change a boundary condition in a problem to make the problem have a prescribed spectrum

We consider a boundary value problem for an ordinary differential equation of order n with a spectral parameter in n boundary conditions. We suggest a method for changing one of the boundary conditions so as to make the problem have a prescribed spectrum.     

On-line Construction of Two-Dimensional Suffix Trees

We say that a data structure is builton-lineif, at any instant, we have the data structure corresponding to the input we have seen up to that instant. For instance, consider the suffix tree of a stringx[1, n]. An algorithm building iton-lineis such that, when we have read the firstisymbols ofx[1, n], we have the suffix tree forx[1, i]. We present a new technique, which we refer to asimplicit updates, based on which we obtain: (a) an algorithm for theon-lineconstruction of the Lsuffix tree of ann×nmatrixA—this data structure is the two-dimensional analog of the suffix tree of a string; (b) simple algorithms implementing primitive operations forLZ1-typeon-line losslessimage compression methods. Those methods, recently introduced by Storer, are generalizations ofLZ1-typecompression methods for strings. For the problem in (a), we get nearly an order of magnitude improvement over algorithms that can be derived from known techniques. For the problem in (b), we do not get an asymptotic speed-up with respect to what can be done with known techniques; rather we show that our algorithms are a natural support for the primitive operations. This may lead to faster implementations of those primitive operations. To the best of our knowledge, our technique is the first one that effectively addresses problems related to theon-lineconstruction of two-dimensional suffix trees.     

Local bifurcations of plane running waves for the generalized cubic Schrödinger equation

For the generalized cubic Schrödinger equation, we consider a periodic boundary value problem in the case of n independent space variables. For this boundary value problem, there exists a countable set of plane running waves periodic with respect to the time variable. We analyze their stability and local bifurcations under the change of stability. We show that invariant tori of dimension 2, ..., n + 1 can bifurcate from each of them. We obtain asymptotic formulas for the solutions on invariant tori and stability conditions for bifurcating tori as well as parameter ranges in which, starting from n = 3, a subcritical (stiff) bifurcation of invariant tori is possible.     

Deconstructing Approximate Offsets

We consider the offset-deconstruction problem: Given a polygonal shape?Q with n vertices, can it be expressed, up to a tolerance??? in Hausdorff distance, as the Minkowski sum of another polygonal shape P with a disk of fixed radius? If it does, we also seek a preferably simple-looking solution?P; then, P??s offset constitutes an accurate, vertex-reduced, and smoothened approximation of Q. We give an O(nlogn)-time exact decision algorithm that handles any polygonal shape, assuming the real-RAM model of computation. A variant of the algorithm, which we have implemented using the cgal library, is based on rational arithmetic and answers the same deconstruction problem up to an uncertainty parameter ??; its running time additionally depends on ??. If the input shape is found to be approximable, this algorithm also computes an approximate solution for the problem. It also allows us to solve parameter-optimization problems induced by the offset-deconstruction problem. For convex shapes, the complexity of the exact decision algorithm drops to O(n), which is also the time required to compute a solution?P with at most one more vertex than a vertex-minimal one.     

Minimal condition number for positive definite Hankel matrices using semidefinite programming

We present a semidefinite programming approach for computing optimally conditioned positive definite Hankel matrices of order n. Unlike previous approaches, our method is guaranteed to find an optimally conditioned positive definite Hankel matrix within any desired tolerance. Since the condition number of such matrices grows exponentially with n, this is a very good test problem for checking the numerical accuracy of semidefinite programming solvers. Our tests show that semidefinite programming solvers using fixed double precision arithmetic are not able to solve problems with n>30. Moreover, the accuracy of the results for 24?n?30 is questionable. In order to accurately compute minimal condition number positive definite Hankel matrices of higher order, we use a Mathematica 6.0 implementation of the SDPHA solver that performs the numerical calculations in arbitrary precision arithmetic. By using this code, we have validated the results obtained by standard codes for n?24, and we have found optimally conditioned positive definite Hankel matrices up to n=100.     

Ranks of commutators of Toeplitz operators on the harmonic Bergman space

We study the rank of commutators of two Toeplitz operators on the harmonic Bergman space of the unit disk. We first show that the commutator of any two Toeplitz operators with general symbols can’t have an odd rank. But, given any integer n ≥ 0, we also show that there are two symbols for which the corresponding Toeplitz operators induce the commutator with rank 2n exactly.     

The just-in-time scheduling problem in a flow-shop scheduling system

We study the problem of maximizing the weighted number of just-in-time (JIT) jobs in a flow-shop scheduling system under four different scenarios. The first scenario is where the flow-shop includes only two machines and all the jobs have the same gain for being completed JIT. For this scenario, we provide an O(n³) time optimization algorithm which is faster than the best known algorithm in the literature. The second scenario is where the job processing times are machine-independent. For this scenario, the scheduling system is commonly referred to as a proportionate flow-shop. We show that in this case, the problem of maximizing the weighted number of JIT jobs is NP-hard in the ordinary sense for any arbitrary number of machines. Moreover, we provide a fully polynomial time approximation scheme (FPTAS) for its solution and a polynomial time algorithm to solve the special case for which all the jobs have the same gain for being completed JIT. The third scenario is where a set of identical jobs is to be produced for different customers. For this scenario, we provide an O(n³) time optimization algorithm which is independent of the number of machines. We also show that the time complexity can be reduced to O(n log n) if all the jobs have the same gain for being completed JIT. In the last scenario, we study the JIT scheduling problem on m machines with a no-wait restriction and provide an O(mn²) time optimization algorithm.