Thomae formulae for general fully ramified <Emphasis Type="Italic">Z</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript> curves

We generalize the elementary methods presented in several examples in the book [FZ] to obtain the Thomae formulae for general fully ramified Z _n curves.     

Some class 1 graphs on <Emphasis Type="Italic">g</Emphasis><Subscript><Emphasis Type="Italic">c</Emphasis></Subscript>-colorings

An edge-coloring of a graph G is an assignment of colors to all the edges of G. A g _c -coloring of a graph G is an edge-coloring of G such that each color appears at each vertex at least g(v) times. The maximum integer k such that G has a g _c -coloring with k colors is called the g _c -chromatic index of G and denoted by \(\chi\prime_{g_{c}}\)(G). In this paper, we extend a result on edge-covering coloring of Zhang and Liu in 2011, and give a new sufficient condition for a simple graph G to satisfy \(\chi\prime_{g_{c}}\)(G) = δ _g (G), where \(\delta_{g}\left(G\right) = min_{v\epsilon V (G)}\left\{\lfloor\frac{d\left(v\right)}{g\left(v\right)}\rfloor\right\}\).     

Complete Minors In <Emphasis Type="Italic">K</Emphasis><Subscript><Emphasis Type="Italic">s,s</Emphasis></Subscript>-Free Graphs

We prove that for a fixed integer s2 every K _s,s -free graph of average degree at least r contains a K _p minor where . A well-known conjecture on the existence of dense K _s,s -free graphs would imply that the value of the exponent is best possible. Our result implies Hadwigers conjecture for K _s,s -free graphs whose chromatic number is sufficiently large compared with s.     

Continuous <Emphasis Type="Italic">l</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis>,<Emphasis Type="Italic">p</Emphasis></Subscript>-symmetric distributions

For p > 0, the l _n,p -generalized surface measure on the l _n,p -unit sphere is studied and used for deriving a geometric measure representation for l _n,p -symmetric distributions having a density.     

On constant <Emphasis Type="Italic">Uq</Emphasis>(<Emphasis Type="Italic">sl</Emphasis><Subscript>2</Subscript>)-invariant <Emphasis Type="Italic">R</Emphasis>-matrices

We consider the spectral resolution of a Uq (sl ₂)-invariant solution R of the constant Yang–Baxter equation in the braid group form. It is shown that if the two highest coefficients in this resolution are not equal, then R is either the Drinfeld R-matrix or its inverse. Bibliography: 13 titles.     

Geometric dual formulation for first-derivative-based univariate cubic <Emphasis Type="Italic">L</Emphasis><Subscript>1</Subscript> splines

With the objective of generating “shape-preserving” smooth interpolating curves that represent data with abrupt changes in magnitude and/or knot spacing, we study a class of first-derivative-based -smooth univariate cubic L ₁ splines. An L ₁ spline minimizes the L ₁ norm of the difference between the first-order derivative of the spline and the local divided difference of the data. Calculating the coefficients of an L ₁ spline is a nonsmooth non-linear convex program. Via Fenchel’s conjugate transformation, the geometric dual program is a smooth convex program with a linear objective function and convex cubic constraints. The dual-to-primal transformation is accomplished by solving a linear program.     

The Cauchy Boundary Value Problems on Closed Piecewise Smooth Manifolds in <Emphasis Type="Italic">C</Emphasis><Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>

Suppose that D is a bounded domain with a piecewise C^1 smooth boundary in C^n. Let ψ∈C^1 α(δD). By using the Hadamard principal value of the higher order singular integral and solid angle coefficient method of points on the boundary, we give the Plemelj formula of the higher order singular integral with the Boehner-Martinelli kernel, which has integral density ψ. Moreover, by means of the Plemelj formula and methods of complex partial differential equations, we discuss the corresponding Cauehy boundary value problem with the Boehner-Martinelli kernel on a closed piecewise smooth manifold and obtain its unique branch complex harmonic solution.     

Convergence of greedy algorithm in Walsh system in <Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>

Convergence of the greedy algorithm in Walsh system in L _p , p > 1 is studied. It is proved that there exists a function in L _p , 1 < p < 2, with greedy algorithm not converging in measure to that function. A continuous function with divergent in L _p , p > 2, greedy algorithm is constructed and sufficient conditions for convergence of the greedy algorithm in L _p , p > 1 are given.     

Selberg＇s Normal Density Theorem for Automorphic L-Functions for GLm

Let π be an irreducible unitary cuspidal representation of GLm（AQ） with m ≥ 2, and L（s, Tr） the L-function attached to π. Under the Generalized Riemann Hypothesis for L（s,π）, we estimate the normal density of primes in short intervals for the automorphic L-function L（s, π）. Our result generalizes the corresponding theorem of Selberg for the Riemann zeta-function.     

On a new property of <Emphasis Type="Italic">n</Emphasis>-poised and <Emphasis Type="Italic">G</Emphasis><Emphasis Type="Italic">C</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript> sets

In this paper we consider n-poised planar node sets, as well as more special ones, called G C _n sets. For the latter sets each n-fundamental polynomial is a product of n linear factors as it always holds in the univariate case. A line ? is called k-node line for a node set \(\mathcal X\) if it passes through exactly k nodes. An (n + 1)-node line is called maximal line. In 1982 M. Gasca and J. I. Maeztu conjectured that every G C _n set possesses necessarily a maximal line. Till now the conjecture is confirmed to be true for n ≤ 5. It is well-known that any maximal line M of \(\mathcal X\) is used by each node in \(\mathcal X\setminus M, \)meaning that it is a factor of the fundamental polynomial. In this paper we prove, in particular, that if the Gasca-Maeztu conjecture is true then any n-node line of G C _n set \(\mathcal {X}\) is used either by exactly \(\binom {n}{2}\) nodes or by exactly \(\binom {n-1}{2}\) nodes. We prove also similar statements concerning n-node or (n ? 1)-node lines in more general n-poised sets. This is a new phenomenon in n-poised and G C _n sets. At the end we present a conjecture concerning any k-node line.     

Distance-Regular Shilla Graphs with <Emphasis Type="Italic">b</Emphasis><Subscript>2</Subscript> = <Emphasis Type="Italic">c</Emphasis><Subscript>2</Subscript>

A Shilla graph is defined as a distance-regular graph of diameter 3 with second eigen-value θ₁ equal to a₃. For a Shilla graph, let us put a = a₃ and b = k/a. It is proved in this paper that a Shilla graph with b₂ = c₂ and noninteger eigenvalues has the following intersection array:

$$\left\{ {\frac{{{b^2}\left( {b - 1} \right)}}{2},\frac{{\left( {b - 1} \right)\left( {{b^2} - b + 2} \right)}}{2},\frac{{b\left( {b - 1} \right)}}{4};1,\frac{{b\left( {b - 1} \right)}}{4},\frac{{b{{\left( {b - 1} \right)}^2}}}{2}} \right\}$$

If Γ is a Q-polynomial Shilla graph with b₂ = c₂ and b = 2r, then the graph Γ has intersection array

$$\left\{ {2tr\left( {2r + 1} \right),\left( {2r + 1} \right)\left( {2rt + t + 1} \right),r\left( {r + t} \right);1,r\left( {r + t} \right),t\left( {4{r^2} - 1} \right)} \right\}$$

and, for any vertex u in Γ, the subgraph Γ₃(u) is an antipodal distance-regular graph with intersection array

$$\left\{ {t\left( {2r + 1} \right),\left( {2r - 1} \right)\left( {t + 1} \right),1;1,t + 1,t\left( {2r + 1} \right)} \right\}$$

The Shilla graphs with b₂ = c₂ and b = 4 are also classified in the paper.

     

On <Emphasis Type="Italic">K</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis>,<Emphasis Type="Italic">q</Emphasis></Subscript>-factorization of complete bipartite multigraphs

Let λK _m,n be a complete bipartite multigraph with two partite sets having m and n vertices, respectively. A K _p,q -factorization of λK _m,n is a set of edge-disjoint K _p,q -factors of λK _m,n which partition the set of edges of λK _m,n . When p = 1 and q is a prime number, Wang, in his paper [On K _1,q -factorization of complete bipartite graph, Discrete Math., 126: (1994), 359-364], investigated the K _1,q -factorization of K _m,n and gave a sufficient condition for such a factorization to exist. In papers [K _1,k -factorization of complete bipartite graphs, Discrete Math., 259: 301-306 (2002),; K _p,q -factorization of complete bipartite graphs, Sci. China Ser. A-Math., 47: (2004), 473-479], Du and Wang extended Wang’s result to the case that p and q are any positive integers. In this paper, we give a sufficient condition for λK _m,n to have a K _p,q -factorization. As a special case, it is shown that the necessary condition for the K _p,q -factorization of λK _m,n is always sufficient when p : q = k : (k + 1) for any positive integer k.     

Graded central polynomials for the algebra <Emphasis Type="Italic">M</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>(<Emphasis Type="Italic">K</Emphasis>)

Let M _n (K) be the algebra of all n × n matrices over an infinite field K. This algebra has a natural ℤ _n -grading and a natural ℤ-grading. Finite bases for its ℤ _n -graded identities and for its ℤ-graded identities are known. In this paper we describe finite generating sets for the ℤ _n -graded and for the ℤ-graded central polynomials for M _n (K) Partially supported by CNPq 620025/2006-9     

Rationality of the vertex operator algebra <Emphasis Type="Italic">V</Emphasis><Subscript><Emphasis Type="Italic">L</Emphasis></Subscript>+ for a positive definite even lattice <Emphasis Type="Italic">L</Emphasis>

The lattice vertex operator algebra V_L associated to a positive definite even lattice L has an automorphism of order 2 lifted from –1-isometry of L. The fixed point set V_L+ of V_L for the automorphism is naturally a vertex operator algebra. We prove that any ₀-graded weak V_L⁺-module is completely reducible.Supported by JSPS Research Fellowships for Young Scientists.     

Exact <Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">2</Emphasis></Subscript>-small ball behavior of integrated Gaussian processes and spectral asymptotics of boundary value problems

We find the exact small deviation asymptotics for the L₂-norm of various m-times integrated Gaussian processes closely connected with the Wiener process and the Ornstein – Uhlenbeck process. Using a general approach from the spectral theory of linear differential operators we obtain the two-term spectral asymptotics of eigenvalues in corresponding boundary value problems. This enables us to improve the recent results from [15] on the small ball asymptotics for a class of m-times integrated Wiener processes. Moreover, the exact small ball asymptotics for the m-times integrated Brownian bridge, the m-times integrated Ornstein – Uhlenbeck process and similar processes appear as relatively simple examples illustrating the developed general theory.Partially supported by grants of RFBR 01-01-00245 and 02-01-01099.     

Asymptotic <Emphasis Type="Italic">T</Emphasis><Subscript><Emphasis Type="Italic">u</Emphasis></Subscript>-Toeplitzness of weighted composition operators on <Emphasis Type="Italic">H</Emphasis><Superscript>2</Superscript>

Given a unilateral forward shift S acting on a complex, separable, innite dimensional Hilbert space H, an asymptotically S-Toeplitz operator is a bounded linear operator T on H satisfying that {S* ⁿ TS ⁿ } is convergent with respect to one of the topologies commonly used in the algebra of bounded linear operators on H. In this paper, we study the asymptotic T _u -Toeplitzness of weighted composition operators on the Hardy space H², where u is a nonconstant inner function.     

Cyclic codes over <Emphasis Type="Italic">R</Emphasis><Subscript><Emphasis Type="Italic">k</Emphasis></Subscript>

Cyclic codes over an infinite family of rings are defined. The general properties of cyclic codes over these rings are studied, in particular nontrivial one-generator cyclic codes are characterized. It is also proved that the binary images of cyclic codes over these rings under the natural Gray map are binary quasi-cyclic codes of index 2 ^k . Further, several optimal or near optimal binary codes are obtained from cyclic codes over R _k via this map.     

Novikov superalgebras with <Emphasis Type="Italic">A</Emphasis><Subscript>0</Subscript> = <Emphasis Type="Italic">A</Emphasis><Subscript>1</Subscript><Emphasis Type="Italic">A</Emphasis><Subscript>1</Subscript>

Novikov superalgebras are related to quadratic conformal superalgebras which correspond to the Hamiltonian pairs and play a fundamental role in completely integrable systems. In this note we show that the Novikov superalgebras with A ₀ = A ₁ A ₁ and dim A ₁ = 2 are of type N and give a class of Novikov superalgebras of type S with A ₀ = A ₁ A ₁.     

Some isomorphism results for Thompson-like groups <Emphasis Type="Italic">V</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>(<Emphasis Type="Italic">G</Emphasis>)

The natural automorphism group of a translation surface is its group of translations. For finite translation surfaces of genus g ≥ 2 the order of this group is naturally bounded in terms of g due to a Riemann–Hurwitz formula argument. In analogy with classical Hurwitz surfaces, we call surfaces which achieve the maximal bound Hurwitz translation surfaces. We study for which g there exist Hurwitz translation surfaces of genus g.