On Saito-Kurokawa descent for congruence subgroups

The conjecture made by H. Saito and N. Kurokawa states the existence of a “lifting” from the space of elliptic modular forms of weight 2k?2 (for the full modular group) to the subspace of the space of Siegel modular forms of weightk (for the full Siegel modular group) which is compatible with the action of Hecke operators. (The subspace is the so called “Maaß spezialschar” defined by certain identities among Fourier coefficients). This conjecture was proved (in parts) by H. Maaß, A.N. Andrianov and D. Zagier. The purpose of this paper is to prove a generalised version of the conjecture for cusp forms of odd squarefree level.     

An example of a “bad” function with “good” Fourier coefficients

An example of a “bad” integrable function with “good” Fourier coefficients is constructed in the paper. This result generalizes one theorem of M.I. D’yachenko and S. Yu. Tikhonov.     

A Counterexample to the “Hot Spots” Conjecture on Nested Fractals

Although the “hot spots” conjecture was proved to be false on some classical domains, the problem still generates a lot of interests on identifying the domains that the conjecture hold. The question can also be asked on fractal sets that admit Laplacians. It is known that the conjecture holds on the Sierpinski gasket and its variants. In this note, we show surprisingly that the “hot spots” conjecture fails on the hexagasket, a typical nested fractal set. The technique we use is the spectral decimation method of eigenvalues of Laplacian on fractals.     

A smooth and unified proof of cases 6, 5 and 3 of the ringel-youngs theorem

A proof of the Heawood conjecture for Cases 6, 5, and 3 is given; “unified” means that the same “geometry” and “zigzag” are used in each of the three cases; “smooth” means that the zigzag is of simplest possible type and that the related “chord problems” are trivial or nearly so.     

Quasi-periodic Orbits in Siegel Disks/Balls and the Babylonian Problem

We investigate numerically complex dynamical systems where a fixed point is surrounded by a disk or ball of quasi-periodic orbits, where there is a change of variables (or conjugacy) that converts the system into a linear map. We compute this “linearization” (or conjugacy) from knowledge of a single quasi-periodic trajectory. In our computations of rotation rates of the almost periodic orbits and Fourier coefficients of the conjugacy, we only use knowledge of a trajectory, and we do not assume knowledge of the explicit form of a dynamical system. This problem is called the Babylonian problem: determining the characteristics of a quasi-periodic set from a trajectory. Our computation of rotation rates and Fourier coefficients depends on the very high speed of our computational method “the weighted Birkhoff average”.     

The Darmon-Dasgupta units over genus fields and the Shimura correspondence

We study a special case of the Gross-Stark conjecture (Gross, 1981 [Gr]), namely over genus fields. Based on the same idea we provide evidence of the rationality conjecture of the elliptic units for real quadratic fields over genus fields, which is a refinement of the Gross-Stark conjecture given by Darmon and Dasgupta (2006) [DD]. Then a relationship between these units and the Fourier coefficients of p-adic Eisenstein series of half-integral weight is explained.     

Instability analysis of the split‐step Fourier method on the background of a soliton of the nonlinear Schrödinger equation

We analyze a numerical instability that occurs in the well‐known split‐step Fourier method on the background of a soliton. This instability is found to be very sensitive to small changes of the parameters of both the numerical grid and the soliton, unlike the instability of most finite‐difference schemes. Moreover, the principle of “frozen coefficients,” in which variable coefficients are treated as “locally constant” for the purpose of stability analysis, is strongly violated for the instability of the split‐step method on the soliton background. Our analysis quantitatively explains all these features. It is enabled by the fact that the period of oscillations of the unstable Fourier modes is much smaller than the width of the soliton. Our analysis is different from the von Neumann analysis in that it requires spatially growing or decaying harmonics (not localized near the boundaries) as opposed to purely oscillatory ones. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 28: 641–669, 2012     

Higher cohomology for Anosov actions on certain homogeneous spaces

We study the smooth untwisted cohomology with real coefficients for the action on [SL(2,?)×…×SL(2,?)]/Γ by the subgroup of diagonal matrices, where Γ is an irreducible lattice. We show that in the top degree, the obstructions to solving the coboundary equation come from distributions that are invariant under the action. We also show that in intermediate degrees, the cohomology trivializes. It has been conjectured by A. Katok and S. Katok that, analogously to Liv?ic’s theorem for Anosov flows for a standard partially hyperbolic ? ^d - or ? ^d - action, the obstructions to solving the top-degree coboundary equation are given by periodic orbits, and also that the intermediate cohomology trivializes, as it is known to do in the first degree by work of Katok and Spatzier. Katok and Katok proved their conjecture for abelian groups of toral automorphisms. Our results verify the “intermediate cohomology” part of the conjecture for diagonal subgroup actions on SL(2,?) ^d /Γ and are a step in the direction of the “top-degree cohomology” part.     

Invariant Measures and the Soliton Resolution Conjecture

The soliton resolution conjecture for the focusing nonlinear Schrödinger equation (NLS) is the vaguely worded claim that a global solution of the NLS, for generic initial data, will eventually resolve into a radiation component that disperses like a linear solution, plus a localized component that behaves like a soliton or multisoliton solution. Considered to be one of the fundamental open problems in the area of nonlinear dispersive equations, this conjecture has eluded a proof or even a precise formulation to date. This paper proves a “statistical version” of this conjecture at mass‐subcritical nonlinearity, in the following sense: The uniform probability distribution on the set of all functions with a given mass and energy, if such a thing existed, would be a natural invariant measure for the NLS flow and would reflect the long‐term behavior for “generic initial data” with that mass and energy. Unfortunately, such a probability measure does not exist. We circumvent this problem by constructing a sequence of discrete measures that, in principle, approximate this fictitious probability distribution as the grid size goes to 0. We then show that a continuum limit of this sequence of probability measures does exist in a certain sense, and in agreement with the soliton resolution conjecture, the limit measure concentrates on the unique ground state soliton. Combining this with results from ergodic theory, we present a tentative formulation and proof of the soliton resolution conjecture in the discrete setting. The above results, following in the footsteps of a program of studying the long‐term behavior of nonlinear dispersive equations through their natural invariant measures initiated by Lebowitz, Rose, and Speer and carried forward by Bourgain, McKean, Tzvetkov, Oh, and others, are proved using a combination of techniques from large deviations, PDEs, harmonic analysis, and bare‐hands probability theory. It is valid in any dimension. © 2014 Wiley Periodicals, Inc.     

Order stars and stability theorems

This paper clears up to the following three conjectures:

1. The conjecture of Ehle [1] on theA-acceptability of Padé approximations toe ^z , which is true;
2. The conjecture of Nørsett [5] on the zeros of the “E-polynomial”, which is false;
3. The conjecture of Daniel and Moore [2] on the highest attainable order of certainA-stable multistep methods, which is true, generalizing the well-known Theorem of Dahlquist.

We further give necessary as well as sufficient conditions forA-stable (acceptable) rational approximations, bounds for the highest order of “restricted” Padé approximations and prove the non-existence ofA-acceptable restricted Padé approximations of order greater than 6. The method of proof, just looking at “order stars” and counting their “fingers”, is very natural and geometric and never uses very complicated formulas.     

Eta products of weight one,and decomposition of primes in non-abelian extensions

This article is a slightly extended and revised version of a conference talk at “Arithmetik an der A7” in Würzburg, June 23rd, 2017. We present a conjecture on the coincidence of Hecke theta series of weight 1 on three distinct quadratic fields. Then we discuss a special instance of the Deligne–Serre Theorem, implying that the decomposition of prime numbers in a certain extension of the rationals is governed by the coefficients of the eta product \(\eta^{2}(z)\).     

The Number of Seymour Vertices in Random Tournaments and Digraphs

Seymour’s distance two conjecture states that in any digraph there exists a vertex (a “Seymour vertex”) that has at least as many neighbors at distance two as it does at distance one. We explore the validity of probabilistic statements along lines suggested by Seymour’s conjecture, proving that almost surely there are a “large” number of Seymour vertices in random tournaments and “even more” in general random digraphs.     

Complexity of linear programming

The complexity of linear programming is discussed in the “integer” and “real number” models of computation. Even though the integer model is widely used in theoretical computer science, the real number model is more useful for estimating an algorithm's running time in actual computation.Although the ellipsoid algorithm is a polynomial-time algorithm in the integer model, we prove that it has unbounded complexity in the real number model. We conjecture that there exists no polynomial-time algorithm for the linear inequalities problem in the real number model. We also conjecture that linear inequalities are strictly harder than linear equalities in all “reasonable” models of computation.     

The No Gap Conjecture for tame hereditary algebras

The “No Gap Conjecture” of Brüstle–Dupont–Pérotin states that the set of lengths of maximal green sequences for hereditary algebras over an algebraically closed field has no gaps. This follows from a stronger conjecture that any two maximal green sequences can be “polygonally deformed” into each other. We prove this stronger conjecture for all tame hereditary algebras over any field, equivalently, for any acyclic tame skew-symmetrizable exchange matrix.     

Computation of worst geometric imperfection profiles of composite cylindrical shell panels by minimizing the non-linear buckling load

In this article the “most unfavorable” shape of initial geometric imperfection profile for laminated cylindrical shell panel is obtained analytically by minimizing the limit point load. The partial differential equations governing the shell stability problem are reduced to a set of non-linear algebraic equations using Galerkin's technique. The non-linear equilibrium path is traced by employing Newton–Raphson method in conjunction with the Riks approach. A double Fourier series is used to represent the initial geometric imperfection profile for the cylindrical shell panel. The optimum values of these Fourier coefficients are determined by minimizing the limit point load using genetic algorithm. The results are determined for simply supported composite cylindrical shell panel. Numerical results show that more number of terms is needed in Fourier series representation to obtain the “worst” geometric imperfection profile which gives lower limit load compared to single term representation of imperfection. We have incorporated constraints on the shape of imperfection to avoid unrealistic limit point loads (due to imperfection shape) as we have assumed that the imperfection is due to machining/manufactuting.     

How well does the finite Fourier transform approximate the Fourier transform?

We show that the answer to the question in the title is “very well indeed.” In particular, we prove that, throughout the maximum possible range, the finite Fourier coefficients provide a good approximation to the Fourier coefficients of a piecewise continuous function. For a continuous periodic function, the size of the error is estimated in terms of the modulus of continuity of the function. The estimates improve commensurately as the functions become smoother. We also show that the partial sums of the finite Fourier transform provide essentially as good an approximation to the function and its derivatives as the partial sums of the ordinary Fourier series. Along the way we establish analogues of the Riemann‐Lebesgue lemma and the localization principle. © 2004 Wiley Periodicals, Inc.     

Relative k-cycles and local elliptic boundary conditions

In this paper, we discuss the following conjecture raised by Baum and Douglas: For any first order elliptic differential operator D on a smooth manifold M with boundary ?M D possesses a (local) elliptic boundary condition if and only if ?[D]=0 in K₁(?M), where [D] is the relative K-cycle in K_o(M,?M) corresponding to D. We prove the “if” part of this conjecture for dim(M)≠4,5,6,7 and the “only if” part of the conjecture for arbitrary dimension.     

关于非线性Lipschitz算子的Sderlind猜想

设ｆ是以Ｌ（ｆ）为最小上界Ｌｉｐｓｃｈｉｔｚ常数、以ρ（ｆ）为谱域半径、以ｒ（ｆ）为Ｇｅｒｓｃｈｇｏｒｉｍ域半径的有限维非线性Ｌｉｐｓｃｈｉｔｚ算子．本文证明了“存在等价范数‖·‖使Ｌ（ｆ）＝ｒ（ｆ）”的Ｓｄｅｒｌｉｎｄ猜想；给出反例否定了Ｓｄｅｒｌｉｎｄ的另一个猜想：“存在等价范数‖·‖使Ｌ（ｆ）ｒ（ｆ）”（注意ｒ（ｆ）与ｒ（ｆ）的区别），同时也否定了“ε＞０，存在等价范数‖·‖ε使Ｌε（ｆ）ρ（ｆ）＋ε”的猜想．作为以上所获结论的应用，本文将有关Ｄａｕｇａｖｅｔ方程的相应结果推广到了非线性算子情形．     

Singularity conjecture and constructions of Jacobi forms

This paper verifies the singularity conjecture for Jacobi forms with higher degree in some typical cases, and gives constructions for the Jacobi cusp forms whose Fourier coefficients can be expressed by some kind of Rankin-typeL-series.     

On the complete cd-index of a Bruhat interval

We study the non-negativity conjecture of the complete cd-index of a Bruhat interval as defined by Billera and Brenti. For each cd-monomial M we construct a set of paths, such that if a “flip condition” is satisfied, then the number of these paths is the coefficient of the monomial M in the complete cd-index. When the monomial contains at most one d, then the condition follows from Dyer’s proof of Cellini’s conjecture. Hence the coefficients of these monomials are non-negative. We also relate the flip condition to shelling of Bruhat intervals.