Fourier series for zeta function via Sinc

In this paper we derive some Fourier series and Fourier polynomial approximations to a function F which has the same zeros as the zeta function, ζ(z) on the strip {z∈C:0<Rz<1}. These approximations depend on an arbritrary positive parameter h, and which for arbitrary ε∈(0,1/2), converge uniformly to ζ(z) on the rectangle {z∈C:ε<Rz<1-ε,-π/h<Iz<π/h}.     

Listing minimal edge-covers of intersecting families with applications to connectivity problems

Let G=(V,E) be a directed/undirected graph, let s,t∈V, and let F be an intersecting family on V (that is, X∩Y,X∪Y∈F for any intersecting X,Y∈F) so that s∈X and t∉X for every X∈F. An edge set I⊆E is an edge-cover of F if for every X∈F there is an edge in I from X to V−X. We show that minimal edge-covers of F can be listed with polynomial delay, provided that, for any I⊆E the minimal member of the residual family F_I of the sets in F not covered by I can be computed in polynomial time. As an application, we show that minimal undirected Steiner networks, and minimal k-connected and k-outconnected spanning subgraphs of a given directed/undirected graph, can be listed in incremental polynomial time.     

Ideal convergence of continuous functions

For a given ideal I⊆P(ω), IC(I) denotes the class of separable metric spaces X such that whenever is a sequence of continuous functions convergent to zero with respect to the ideal I then there exists a set of integers {m₀<m₁<?} from the dual filter F(I) such that limi→∞fmi(x)=0 for all x∈X. We prove that for the most interesting ideals I, IC(I) contains only singular spaces. For example, if I=Id is the asymptotic density zero ideal, all IC(Id) spaces are perfectly meager while if I=Ib is the bounded ideal then IC(Ib) spaces are σ-sets.     

A Sard theorem for tame set-valued mappings

If F is a set-valued mapping from Rn into Rm with closed graph, then y∈Rm is a critical value of F if for some x with y∈F(x), F is not metrically regular at (x,y). We prove that the set of critical values of a set-valued mapping whose graph is a definable (tame) set in an o-minimal structure containing additions and multiplications is a set of dimension not greater than m−1 (respectively a σ-porous set). As a corollary of this result we get that the collection of asymptotically critical values of a set-valued mapping with a semialgebraic graph has dimension not greater than m−1. We also give an independent proof of the fact that a definable continuous real-valued function is constant on components of the set of its subdifferentiably critical points.     

A semialgebraic closure for commutative algebra

Let A⊂R be rings containing the rationals. In R let S be a multiplicatively closed subset such that 1∈S and 0∉S, T a preorder of R (a proper subsemiring containing the squares) such that S⊂T and I an A-submodule of R. Define ρ(I) (or ρ_S,T(I)) to be

ρ(I)={a∈R|sa^2m+t∈I^2m for some m∈N,s∈S and t∈T}.     

On classical adjoint-commuting mappings between matrix algebras

Let F be a field and let m and n be integers with m,n?3. Let M_n denote the algebra of n×n matrices over F. In this note, we characterize mappings ψ:M_n→M_m that satisfy one of the following conditions:

1.

|F|=2 or |F|>n+1, and ψ(adj(A+αB))=adj(ψ(A)+αψ(B)) for all A,B∈M_n and α∈F with ψ(I_n)≠0.

2.

ψ is surjective and ψ(adj(A-B))=adj(ψ(A)-ψ(B)) for every A,B∈M_n.

Here, adjA denotes the classical adjoint of the matrix A, and I_n is the identity matrix of order n. We give examples showing the indispensability of the assumption ψ(I_n)≠0 in our results.     

Qualitative analysis of a predator-prey model with Holling type II functional response incorporating a prey refuge

We study a predator-prey model with Holling type II functional response incorporating a prey refuge under homogeneous Neumann boundary condition. We show the existence and non-existence of non-constant positive steady-state solutions depending on the constant m∈(0,1], which provides a condition for protecting (1−m)u of prey u from predation. Moreover, we investigate the asymptotic behavior of spacially inhomogeneous solutions and the local existence of periodic solutions.     

Normal families of meromorphic functions with multiple zeros

Let F be a family of meromorphic functions defined in a domain D such that for each f∈F, all zeros of f(z) are of multiplicity at least 3, and all zeros of f^′(z) are of multiplicity at least 2 in D. If for each f∈F, f^′(z)−1 has at most 1 zero in D, ignoring multiplicity, then F is normal in D.     

Solvability of singular second order m-point boundary value problems

Let be a function satisfying Carathéodory's conditions and (1−t)e(t)∈L¹(0,1). Let ξi∈(0,1), ai∈R, i=1,…,m−2, 0<ξ₁<ξ₂<?<ξm−2<1 be given. This paper is concerned with the problem of existence of a C¹[0,1) solution for the m-point boundary value problem

     

The double negation of the intermediate value theorem

In the context of intuitionistic analysis, we consider the set F consisting of all continuous functions ? from [0,1] to R such that ?(0)=0 and ?(1)=1, and the set I₀ consisting of ?’s in F where there exists x∈[0,1] such that . It is well-known that there are weak counterexamples to the intermediate value theorem, and with Brouwer’s continuity principle we have I₀≠F. However, there exists no satisfying answer to . We try to answer to this question by reducing it to a schema (which we call ) about intuitionistic decidability that asserts “there exists an intuitionistically enumerable set that is not intuitionistically decidable”. We also introduce the notion of strong Specker double sequence, and prove that the existence of such a double sequence is equivalent to the existence of a function ?∈F_mon where .     

Besov regularity for the generalized local time of the indefinite Skorohod integral

Let (t∈[0,1]) be the indefinite Skorohod integral on the canonical probability space (Ω,F,P), and let Lt(x) (t∈[0,1], x∈R) be its the generalized local time introduced by Tudor in [C.A. Tudor, Martingale-type stochastic calculus for anticipating integral processes, Bernoulli 10 (2004) 313-325]. We prove that the generalized local time, as function of x, has the same Besov regularity as the Brownian motion, as function of t, under some conditions imposed on the anticipating integrand u.     

Positive solutions of nonlinear three-point boundary-value problems

Let a∈C[0,1], b∈C([0,1],(−∞,0]). Let φ₁(t) be the unique solution of the linear boundary value problem

u″(t)+a(t)u′(t)+b(t)u(t)=0,t∈(0,1),u(0)=0,u(1)=1.     

The test suite generation problem: Optimal instances and their implications

In the test suite generation (TSG) problem for software systems, I is a set of n input parameters where each I∈I has κ(I) data values, and O is a collection of subsets of I where the interactions of the parameters in each O∈O are thought to affect the outcome of the system. A test case for (I,O,κ) is an n-tuple (t₁,t₂,…,t_n) that specifies the value of each input parameter in I. The goal is to generate a smallest-sized test suite (i.e., a set of test cases) that covers all combinations of each O∈O. The decision version of TSG is known to be NP-complete.In this paper, we present new families of (I,O,κ) for which optimal test suites can be constructed efficiently. They differ from the ones already known by the way we characterize (I,O) and κ. We then use these instances to generate test suites for arbitrary software systems. When each O∈O has |O|=2, the sizes of the test suite are guaranteed to be at most , matching the current best bound for this problem. Our constructions utilize the structure of (I,O) and κ; consequently, the less “complex” (I,O) and κ are, the better are the bounds on the sizes of the test suites.     

On additive polynomials and certain maximal curves

We show that a maximal curve over F_q² given by an equation A(X)=F(Y), where A(X)∈F_q²[X] is additive and separable and where F(Y)∈F_q²[Y] has degree m prime to the characteristic p, is such that all roots of A(X) belong to F_q². In the particular case where F(Y)=Y^m, we show that the degree m is a divisor of q+1.     

Using Lagrangians of hypergraphs to find non-jumping numbers(II)

Let r?2 be an integer. A real number α∈[0,1) is a jump for r if for any ε>0 and any integer m?r, any r-uniform graph with n>n₀(ε,m) vertices and density at least α+ε contains a subgraph with m vertices and density at least α+c, where c=c(α)>0 does not depend on ε and m. A result of Erd?s, Stone and Simonovits implies that every α∈[0,1) is a jump for r=2. Erd?s asked whether the same is true for r?3. Frankl and Rödl gave a negative answer by showing an infinite sequence of non-jumping numbers for every r?3. However, there are a lot of unknowns on determining whether or not a number is a jump for r?3. In this paper, we find two infinite sequences of non-jumping numbers for r=4, and extend one of the results to every r?4. Our approach is still based on the approach developed by Frankl and Rödl.     

Long range variations on the Fibonacci universal code

Fibonacci coding is based on Fibonacci numbers and was defined by Apostolico and Fraenkel (1987) [1]. Fibonacci numbers are generated by the recurrence relation Fi=Fi−1+Fi−2∀i?2 with initial terms F₀=1, F₁=1. Variations on the Fibonacci coding are used in source coding as well as in cryptography. In this paper, we have extended the table given by Thomas [8]. We have found that there is no Gopala-Hemachandra code for a particular positive integer n and for a particular value of a∈Z. We conclude that for n=1,2,3,4, Gopala-Hemachandra code exists for a=−2,−3,…,−20. Also, for 1?n?100, there is at most m consecutive not available (N/A) Gopala-Hemachandra code in GH−(4+m) column where 1?m?16. And, for 1?n?100, as m increases the availability of Gopala-Hemachandra code decreases in GH−(4+m) column where 1?m?16.     

Boundary regularity for viscosity solutions to degenerate elliptic PDEs

Sufficient conditions are given for the solutions to the (fully nonlinear, degenerate) elliptic equation F(x,u,Du,D²u)=0 in Ω to satisfy |u(x)−u(y)|?Cα|x−y| for some α∈(0,1) when x∈Ω and y∈∂Ω.     

Existence results of a m-point boundary value problem at resonance

Let ξ_i∈(0,1), a_i∈(0,∞), i=1,…,m−2, be given constants satisfying ∑^m−2_i=1a_i=1 and 0<ξ₁<ξ₂<?<ξ_m−2<1. We show the existence of solutions for the m-point boundary value problem

x″=f(t,x,x′),t∈(0,1),     

On the singular Weyl-Titchmarsh function of perturbed spherical Schrödinger operators

We investigate the singular Weyl-Titchmarsh m-function of perturbed spherical Schrödinger operators (also known as Bessel operators) under the assumption that the perturbation q(x) satisfies xq(x)∈L¹(0,1). We show existence plus detailed properties of a fundamental system of solutions which are entire with respect to the energy parameter. Based on this we show that the singular m-function belongs to the generalized Nevanlinna class and connect our results with the theory of super singular perturbations.     

Maximal Sidon sets and matroids

A subset X of an abelian group Γ, written additively, is a Sidon set of orderh if whenever {(a_i,m_i):i∈I} and {(b_j,n_j):j∈J} are multisets of size h with elements in X and ∑_i∈Im_ia_i=∑_j∈Jn_jb_j, then {(a_i,m_i):i∈I}={(b_j,n_j):j∈J}. The set X is a generalized Sidon set of order(h,k) if whenever two such multisets have the same sum, then their multiset intersection has size at least k. It is proved that if X is a generalized Sidon set of order (2h−1,h−1), then the maximal Sidon sets of order h contained in X have the same cardinality. Moreover, X is a matroid where the independent subsets of X are the Sidon sets of order h.