Sign changes of Fourier coefficients of Hilbert modular forms

Sign changes of Fourier coefficients of various modular forms have been studied. In this paper, we analyze some sign change properties of Fourier coefficients of Hilbert modular forms, under the assumption that all the coefficients are real. The quantitative results on the number of sign changes in short intervals are also discussed. (C) 2014 Elsevier Inc. All rights reserved.

A study on fear memory retrieval and REM sleep in maternal separation and isolation stressed rats

As rapid brain development occurs during the neonatal period, environmental manipulation during this period may have a significant impact on sleep and memory functions. Moreover, rapid eye movement (REM) sleep plays an important role in integrating new information with the previously stored emotional experience. Hence, the impact of early maternal separation and isolation stress (MS) during the stress hyporesponsive period (SHRP) on fear memory retention and sleep in rats were studied. The neonatal rats were subjected to maternal separation and isolation stress during postnatal days 5-7 (6 h daily/3 d). Polysomnographic recordings and differential fear conditioning was carried out in two different sets of rats aged 2 months. The neuronal replay during REM sleep was analyzed using different parameters. MS rats showed increased time in REM stage and total sleep period also increased. MS rats showed fear generalization with increased fear memory retention than normal control (NC). The detailed analysis of the local field potentials across different time periods of REM sleep showed increased theta oscillations in the hippocampus, amygdala and cortical circuits. Our findings suggest that stress during SHRP has sensitized the hippocampus amygdala cortical loops which could be due to increased release of corticosterone that generally occurs during REM sleep. These rats when subjected to fear conditioning exhibit increased fear memory and increased, fear generalization. The development of helplessness, anxiety and sleep changes in human patients, thus, could be related to the reduced thermal, tactile and social stimulation during SHRP on brain plasticity and fear memory functions. (C) 2014 Elsevier B.V. All rights reserved.

Mixed finite elements for electromagnetic analysis

The occurrence of spurious solutions is a well-known limitation of the standard nodal finite element method when applied to electromagnetic problems. The two commonly used remedies that are used to address this problem are (i) The addition of a penalty term with the penalty factor based on the local dielectric constant, and which reduces to a Helmholtz form on homogeneous domains (regularized formulation); (ii) A formulation based on a vector and a scalar potential. Both these strategies have some shortcomings. The penalty method does not completely get rid of the spurious modes, and both methods are incapable of predicting singular eigenvalues in non-convex domains. Some non-zero spurious eigenvalues are also predicted by these methods on non-convex domains. In this work, we develop mixed finite element formulations which predict the eigenfrequencies (including their multiplicities) accurately, even for nonconvex domains. The main feature of the proposed mixed finite element formulation is that no ad-hoc terms are added to the formulation as in the penalty formulation, and the improvement is achieved purely by an appropriate choice of finite element spaces for the different variables. We show that the formulation works even for inhomogeneous domains where `double noding' is used to enforce the appropriate continuity requirements at an interface. For two-dimensional problems, the shape of the domain can be arbitrary, while for the three-dimensional ones, with our current formulation, only regular domains (which can be nonconvex) can be modeled. Since eigenfrequencies are modeled accurately, these elements also yield accurate results for driven problems. (C) 2014 Elsevier Ltd. All rights reserved.

A constant factor approximation algorithm for boxicity of circular arc graphs

The boxicity (resp. cubicity) of a graph G(V, E) is the minimum integer k such that G can be represented as the intersection graph of axis parallel boxes (resp. cubes) in R-k. Equivalently, it is the minimum number of interval graphs (resp. unit interval graphs) on the vertex set V, such that the intersection of their edge sets is E. The problem of computing boxicity (resp. cubicity) is known to be inapproximable, even for restricted graph classes like bipartite, co-bipartite and split graphs, within an O(n(1-epsilon))-factor for any epsilon > 0 in polynomial time, unless NP = ZPP. For any well known graph class of unbounded boxicity, there is no known approximation algorithm that gives n(1-epsilon)-factor approximation algorithm for computing boxicity in polynomial time, for any epsilon > 0. In this paper, we consider the problem of approximating the boxicity (cubicity) of circular arc graphs intersection graphs of arcs of a circle. Circular arc graphs are known to have unbounded boxicity, which could be as large as Omega(n). We give a (2 + 1/k) -factor (resp. (2 + log n]/k)-factor) polynomial time approximation algorithm for computing the boxicity (resp. cubicity) of any circular arc graph, where k >= 1 is the value of the optimum solution. For normal circular arc (NCA) graphs, with an NCA model given, this can be improved to an additive two approximation algorithm. The time complexity of the algorithms to approximately compute the boxicity (resp. cubicity) is O(mn + n(2)) in both these cases, and in O(mn + kn(2)) = O(n(3)) time we also get their corresponding box (resp. cube) representations, where n is the number of vertices of the graph and m is its number of edges. Our additive two approximation algorithm directly works for any proper circular arc graph, since their NCA models can be computed in polynomial time. (C) 2014 Elsevier B.V. All rights reserved.

Optimal error estimate using mesh equidistribution technique for singularly perturbed system of reaction-diffusion boundary-value problems

In this article, we study the problem of determining an appropriate grading of meshes for a system of coupled singularly perturbed reaction-diffusion problems having diffusion parameters with different magnitudes. The central difference scheme is used to discretize the problem on adaptively generated mesh where the mesh equation is derived using an equidistribution principle. An a priori monitor function is obtained from the error estimate. A suitable a posteriori analogue of this monitor function is also derived for the mesh construction which will lead to an optimal second-order parameter uniform convergence. We present the results of numerical experiments for linear and semilinear reaction-diffusion systems to support the effectiveness of our preferred monitor function obtained from theoretical analysis. (C) 2014 Elsevier Inc. All rights reserved.

On Hermite pseudo-multipliers

In this article we deal with a variation of a theorem of Mauceri concerning the L-P boundedness of operators M which are known to be bounded on L-2. We obtain sufficient conditions on the kernel of the operator M so that it satisfies weighted L-P estimates. As an application we prove L-P boundedness of Hermite pseudo-multipliers. (C) 2014 Elsevier Inc. All rights reserved.

PROPER HOLOMORPHIC MAPS BETWEEN BOUNDED SYMMETRIC DOMAINS REVISITED

We prove that a proper holomorphic map between two nonplanar bounded symmetric domains of the same dimension, one of them being irreducible, is a biholomorphism. Our methods allow us to give a single, all-encompassing argument that unifies the various special cases in which this result is known. We discuss an application of these methods to domains having noncompact automorphism groups that are not assumed to act transitively.

An interior penalty method for distributed optimal control problems governed by the biharmonic operator

In this paper, a C-0 interior penalty method has been proposed and analyzed for distributed optimal control problems governed by the biharmonic operator. The state and adjoint variables are discretized using continuous piecewise quadratic finite elements while the control variable is discretized using piecewise constant approximations. A priori and a posteriori error estimates are derived for the state, adjoint and control variables under minimal regularity assumptions. Numerical results justify the theoretical results obtained. The a posteriori error estimators are useful in adaptive finite element approximation and the numerical results indicate that the sharp error estimators work efficiently in guiding the mesh refinement. (C) 2014 Elsevier Ltd. All rights reserved.

Jacobi forms and differential operators

We affirmatively answer a question due to S. Bocherer concerning the feasibility of removing one differential operator from the standard collection of m + 1 of them used to embed the space of Jacobi forms of weight 2 and index m into several pieces of elliptic modular forms. (C) 2014 Elsevier Inc. All rights reserved.

The Tetrablock as a Spectral Set

The tetrablock, roughly speaking, is the set of all linear fractional maps that map the open unit disc to itself. A formal definition of this inhomogeneous domain is given below. This paper considers triples of commuting bounded operators (A,B,P) that have the tetrablock as a spectral set. Such a triple is named a tetrablock contraction. The motivation comes from the success of model theory in another inhomogeneous domain, namely, the symmetrized bidisc F. A pair of commuting bounded operators (S,P) with Gamma as a spectral set is called a Gamma-contraction, and always has a dilation. The two domains are related intricately as the Lemma 3.2 below shows. Given a triple (A, B, P) as above, we associate with it a pair (F-1, F-2), called its fundamental operators. We show that (A,B,P) dilates if the fundamental operators F-1 and F-2 satisfy certain commutativity conditions. Moreover, the dilation space is no bigger than the minimal isometric dilation space of the contraction P. Whether these commutativity conditions are necessary, too, is not known. what we have shown is that if there is a tetrablock isometric dilation on the minimal isometric dilation space of P. then those commutativity conditions necessarily get imposed on the fundamental operators. En route, we decipher the structure of a tetrablock unitary (this is the candidate as the dilation triple) and a tertrablock isometry (the restriction of a tetrablock unitary to a joint invariant sub-space). We derive new results about r-contractions and apply them to tetrablock contractions. The methods applied are motivated by 11]. Although the calculations are lengthy and more complicated, they beautifully reveal that the dilation depends on the mutual relationship of the two fundamental operators, so that certain conditions need to be satisfied. The question of whether all tetrablock contractions dilate or not is unresolved.

Achieving SK Capacity in the Source Model: When Must All Terminals Talk?

In this paper, we address the problem of characterizing the instances of the multiterminal source model of Csiszar and Narayan in which communication from all terminals is needed for establishing a secret key of maximum rate. We give an information-theoretic sufficient condition for identifying such instances. We believe that our sufficient condition is in fact an exact characterization, but we are only able to prove this in the case of the three-terminal source model.

Admissible fundamental operators(star)

Let F and G be two bounded operators on two Hilbert spaces. Let their numerical radii be no greater than one. This note investigates when there is a Gamma-contraction (S, P) such that F is the fundamental operator of (S, P) and G is the fundamental operator of (S*, P*). Theorem 1 puts a necessary condition on F and G for them to be the fundamental operators of (S, P) and (S*, P*) respectively. Theorem 2 shows that this necessary condition is also sufficient provided we restrict our attention to a certain special case. The general case is investigated in Theorem 3. Some of the results obtained for Gamma-contractions are then applied to tetrablock contractions to figure out when two pairs (F1, F2) and (G(1), G(2)) acting on two Hilbert spaces can be fundamental operators of a tetrablock contraction (A, B, P) and its adjoint (A*, B*, P*) respectively. This is the content of Theorem 3. (C) 2015 Elsevier Inc. All rights reserved.

Multivariate juggling probabilities

We consider refined versions of Markov chains related to juggling introduced by Warrington. We further generalize the construction to juggling with arbitrary heights as well as infinitely many balls, which are expressed more succinctly in terms of Markov chains on integer partitions. In all cases, we give explicit product formulas for the stationary probabilities. The normalization factor in one case can be explicitly written as a homogeneous symmetric polynomial. We also refine and generalize enriched Markov chains on set partitions. Lastly, we prove that in one case, the stationary distribution is attained in bounded time.

Quadrature Domains in C-n

We prove two density theorems for quadrature domains in , . It is shown that quadrature domains are dense in the class of all product domains of the form , where is a smoothly bounded domain satisfying Bell's Condition R and is a smoothly bounded domain and also in the class of all smoothly bounded complete Hartogs domains in C-2.

Directed Nonabelian Sandpile Models on Trees

We define two general classes of nonabelian sandpile models on directed trees (or arborescences), as models of nonequilibrium statistical physics. Unlike usual applications of the well-known abelian sandpile model, these models have the property that sand grains can enter only through specified reservoirs. In the Trickle-down sandpile model, sand grains are allowed to move one at a time. For this model, we show that the stationary distribution is of product form. In the Landslide sandpile model, all the grains at a vertex topple at once, and here we prove formulas for all eigenvalues, their multiplicities, and the rate of convergence to stationarity. The proofs use wreath products and the representation theory of monoids.