Banaschewski’s theorem for <Emphasis Type="Italic">GMV</Emphasis>-algebras

Banaschewski’s theorem concerns subdirect product decompositions of lattice ordered groups. In the present paper we deal with the analogous investigation for the case of generalized MV -algebras (GMV -algebras, in short); we apply this notion in the sense studied by Galatos and Tsinakis.     

A theorem on strongly <Emphasis Type="Italic">η</Emphasis>-representable sets

In this paper we consider strongly η-representable sets. We prove that the union of Σ ₂ ⁰ and Π ₂ ⁰ -sets is strongly η-representable.     

Congruences for Ramanujan’s <Emphasis Type="Italic">ω</Emphasis>(<Emphasis Type="Italic">q</Emphasis>)

Recently, Bruinier and Ono investigated the arithmetic of the coefficients of Ramanujan’s mock theta function ω(q). In Ramanujan J. (submitted) they obtained congruences with respect to the modulus 512. Here we show that ω(q) modulo 5 is dictated by an elliptic curve.     

On blocks with <Emphasis Type="Italic">K</Emphasis>(<Emphasis Type="Italic">B</Emphasis>)−<Emphasis Type="Italic">L</Emphasis>(<Emphasis Type="Italic">B</Emphasis>)=1

We use the method of local representation and original method of Brauer to study the block with K(B)−L(B)=1, and get some properties on the defect group and the structure of this kind of blocks. Then, we show that K(B) conjecture holds for this kind of blocks.     

On the equation Δ<Emphasis Type="Italic">u</Emphasis> + <Emphasis Type="Italic">q</Emphasis>(<Emphasis Type="Italic">x</Emphasis>)<Emphasis Type="Italic">u</Emphasis> = 0

Sufficient conditions for the blow-up of nontrivial generalized solutions of the interior Dirichlet problem with homogeneous boundary condition for the homogeneous elliptic-type equation Δu + q(x)u = 0, where either q(x) ≠ const or q(x) = const= λ > 0, are obtained. A priori upper bounds (Theorem 4 and Remark 6) for the exact constants in the well-known Sobolev and Steklov inequalities are established.     

On Analytic Campanato and <Emphasis Type="Italic">F</Emphasis>(<Emphasis Type="Italic">p</Emphasis>, <Emphasis Type="Italic">q</Emphasis>, <Emphasis Type="Italic">s</Emphasis>) Spaces

We investigate the relation between analytic Campanato spaces \(\mathcal {AL}_{p,s}\) and the spaces F(p, q, s), characterize the bounded and compact Riemann–Stieltjes operators from \(\mathcal {AL}_{p,s}\) to \(F(p,p-s-1,s)\). We also describe the corona theorem and the interpolating sequences for the class \(F(p,p-2,s)\), which is the Möbius invariant subspace of the analytic Besov type spaces \(B_p(s)\).     

A theorem of the alternatives for the equation |<Emphasis Type="Italic">Ax</Emphasis>| − |<Emphasis Type="Italic">B</Emphasis>||<Emphasis Type="Italic">x</Emphasis>| = <Emphasis Type="Italic">b</Emphasis>

A theorem of the alternatives for the equation \({|Ax|-|B||x|=b\ (A,B\in{\mathbb{R}}^{n\times n},\, b\in{\mathbb{R}}^n)}\) is proved and several consequences are drawn. In particular, a class of matrices A, B is identified for which the equation has exactly 2 ⁿ solutions for each positive right-hand side b.     

On <Emphasis Type="Italic">Saaty</Emphasis>’s and <Emphasis Type="Italic">Koczkodaj</Emphasis>’s inconsistencies of pairwise comparison matrices

The aim of the paper is to obtain some theoretical and numerical properties of Saaty’s and Koczkodaj’s inconsistencies of pairwise comparison matrices (PRM). In the case of 3 ×  3 PRM, a differentiable one-to-one correspondence is given between Saaty’s inconsistency ratio and Koczkodaj’s inconsistency index based on the elements of PRM. In order to make a comparison of Saaty’s and Koczkodaj’s inconsistencies for 4  ×  4 pairwise comparison matrices, the average value of the maximal eigenvalues of randomly generated n ×  n PRM is formulated, the elements a _ij (i < j) of which were randomly chosen from the ratio scale

An <Emphasis Type="Italic">R</Emphasis> = <Emphasis Type="Italic">T</Emphasis> theorem for imaginary quadratic fields

We prove the modularity of certain residually reducible p-adic Galois representations of an imaginary quadratic field assuming the uniqueness of the residual representation. We obtain an R = T theorem using a new commutative algebra criterion that might be of independent interest. To apply the criterion, one needs to show that the quotient of the universal deformation ring R by its ideal of reducibility is cyclic Artinian of order no greater than the order of the congruence module T/J, where J is an Eisenstein ideal in the local Hecke algebra T. The inequality is proven by applying the Main conjecture of Iwasawa Theory for Hecke characters and using a result of Berger [Compos Math 145(3):603–632, 2009]. This strengthens our previous result [Berger and Klosin, J Inst Math Jussieu 8(4):669–692, 2009] to include the cases of an arbitrary p-adic valuation of the L-value, in particular, cases when R is not a discrete valuation ring. As a consequence we show that the Eisenstein ideal is principal and that T is a complete intersection.     

Systematic Construction of <Emphasis Type="Italic">q</Emphasis>-Analogs of <Emphasis Type="Italic">t</Emphasis>−(<Emphasis Type="Italic">v</Emphasis>,<Emphasis Type="Italic">k</Emphasis>,λ)-Designs

In the present paper we consider a q-analog of t–(v,k,)-designs. It is canonic since it arises by replacing sets by vector spaces over GF(q), and their orders by dimensions. These generalizations were introduced by Thomas [Geom.Dedicata vol. 63, pp. 247–253 (1996)] they are called t –(v,k,;q)- designs. A few of such q-analogs are known today, they were constructed using sophisticated geometric arguments and case-by-case methods. It is our aim now to present a general method that allows systematically to construct such designs, and to give complete catalogs (for small parameters, of course) using an implemented software package. &nbsp; In order to attack the (highly complex) construction, we prepare them for an enormous data reduction by embedding their definition into the theory of group actions on posets, so that we can derive and use a generalization of the Kramer-Mesner matrix for their definition, together with an improved version of the LLL-algorithm. By doing so we generalize the methods developed in a research project on t –(v,k,)-designs on sets, obtaining this way new results on the existence of t–(v,k,;q)-designs on spaces for further quintuples (t,v,k,;q) of parameters. We present several 2–(6,3,;2)-designs, 2–(7,3,;2)-designs and, as far as we know, the very first 3-designs over GF(q).classification 05B05     

Bishop’s theorem and differentiability of a subspace of <Emphasis Type="Italic">C</Emphasis><Subscript><Emphasis Type="Italic">b</Emphasis></Subscript>(<Emphasis Type="Italic">K</Emphasis>)

Let K be a Hausdorff space and C _b (K) be the Banach algebra of all complex bounded continuous functions on K. We study the Gateaux and Fréchet differentiability of subspaces of C _b (K). Using this, we show that the set of all strong peak functions in a nontrivial separating separable subspace H of C _b (K) is a dense G _δ subset of H, if K is compact. This gives a generalized Bishop’s theorem, which says that the closure of the set of all strong peak points for H is the smallest closed norming subset of H. The classical Bishop’s theorem was proved for a separating subalgebra H and a metrizable compact space K.     

On common values of <Emphasis Type="Italic">φ</Emphasis>(<Emphasis Type="Italic">n</Emphasis>) and <Emphasis Type="Italic">σ</Emphasis>(<Emphasis Type="Italic">m</Emphasis>). I

We show, conditional on a uniform version of the prime k-tuples conjecture, that there are x/(log x)^1+o(1) numbers not exceeding x common to the ranges of φ and σ. Here φ is Euler’s totient function and σ is the sum-of-divisors function.     

On <Emphasis Type="Italic">α</Emphasis>-regular archimedean <Emphasis Type="Italic">f</Emphasis>-rings

For a commutative ring A with identity, and for infinite cardinals α as well as the symbol ∞, which indicates the situation in which there are no cardinal restrictions, one defines A to be α-regular if for each subset D of A, with |D| < α and de = 0, for any two distinct d, e ∈ D, there is an s ∈ A such that d ² s = d, for each d ∈ D, and if xd = 0, for each d ∈ D, then xs = 0     

On the Gosper’s <Emphasis Type="Italic">q</Emphasis>-constant Π<Subscript><Emphasis Type="Italic">q</Emphasis></Subscript>

Gosper introduced the functions sin_qz and cos_qz as q-analogues for the trigonometric functions sin z and cos z respectively. He stated a variety of identities involving these two q-trigonometric functions along with certain constants denoted by \({\Pi _{{q^n}}}\) (n ∈ N). Gosper noticed that all his formulas on these constants have more than two of the \({\Pi _{{q^n}}}\). So, it is natural to raise the question of establishing identities involving only two of the \({\Pi _{{q^n}}}\). In this paper, our main goal is to give examples of such formulas in only two \({\Pi _{{q^n}}}\).     

On Geary’s theorem for the field of <Emphasis Type="Italic">p</Emphasis>-adic numbers

Let ?_p, where p > 2, be a field of p-adic numbers. We consider two independent identically distributed random variables with values in ?_p and distribution μ with a continuous density. We prove that the sum and the squared difference of these random variables are independent if and only if μ is an idempotent distribution, i.e., a shift of the Haar distribution of a compact subgroup of the additive group of the field ?_p.     

Better <Emphasis Type="Italic">s</Emphasis>–<Emphasis Type="Italic">t</Emphasis>-tours by Gao trees

We consider the s–t-path TSP: given a finite metric space with two elements s and t, we look for a path from s to t that contains all the elements and has minimum total distance. We improve the approximation ratio for this problem from 1.599 to 1.566. Like previous algorithms, we solve the natural LP relaxation and represent an optimum solution \(x^*\) as a convex combination of spanning trees. Gao showed that there exists a spanning tree in the support of \(x^*\) that has only one edge in each narrow cut [i.e., each cut C with \(x^*(C)<2\)]. Our main theorem says that the spanning trees in the convex combination can be chosen such that many of them are such “Gao trees” simultaneously at all sufficiently narrow cuts.     

The commutation relation <Emphasis Type="Italic">xy</Emphasis>=<Emphasis Type="Italic">qyx</Emphasis>+<Emphasis Type="Italic">hf</Emphasis>(<Emphasis Type="Italic">y</Emphasis>) and Newton’s binomial formula

Let x and y be two variables satisfying the commutation relation xy=qyx+hf(y), where f(y) is a polynomial. In this paper, using Young diagrams and generating functions techniques, we study the binomial formula (x+y) ⁿ and we present an identity for x ^m y. The connection to Operator Calculus is discussed and several special cases are treated explicitly.     

On Lie’s problem and differential invariants of ODEs <Emphasis Type="Italic">y</Emphasis>″ = <Emphasis Type="Italic">F</Emphasis>(<Emphasis Type="Italic">x</Emphasis>, <Emphasis Type="Italic">y</Emphasis>)

A point classification of ordinary differential equations of the form y″ = F(x, y) is considered. The algebra of differential invariants of the action of the point symmetry pseudogroup on the right-hand sides of equations of the form y″ = F(x, y) is calculated, and Lie’s problem on the point equivalence of such equations is solved.     

On <Emphasis Type="Italic">g</Emphasis>-<Emphasis Type="Italic">α</Emphasis>-irresolute functions

We introduce the so-called g-α-irresolute functions in generalized topological spaces. We obtain some properties and several characterizations of this type of functions.     

Relative <Emphasis Type="Italic">t</Emphasis>-designs in binary Hamming association scheme <Emphasis Type="Italic">H</Emphasis>(<Emphasis Type="Italic">n</Emphasis>, 2)

A relative t-design in the binary Hamming association schemes H(n, 2) is equivalent to a weighted regular t-wise balanced design, i.e., certain combinatorial t-design which allows different sizes of blocks and a weight function on blocks. In this paper, we study relative t-designs in H(n, 2), putting emphasis on Fisher type inequalities and the existence of tight relative t-designs. We mostly consider relative t-designs on two shells. We prove that if the weight function is constant on each shell of a relative t-design on two shells then the subset in each shell must be a combinatorial \((t-1)\)-design. This is a generalization of the result of Kageyama who proved this under the stronger assumption that the weight function is constant on the whole block set. Using this, we define tight relative t-designs for odd t, and a strong restriction on the possible parameters of tight relative t-designs in H(n, 2). We obtain a new family of such tight relative t-designs, which were unnoticed before. We will give a list of feasible parameters of such relative 3-designs with \(n \le 100\), and then we discuss the existence and/or the non-existence of such tight relative 3-designs. We also discuss feasible parameters of tight relative 4-designs on two shells in H(n, 2) with \(n \le 50\). In this study we come up with the connection on the topics of classical design theory, such as symmetric 2-designs (in particular 2-\((4u-1,2u-1,u-1)\) Hadamard designs) and Driessen’s result on the non-existence of certain 3-designs. We believe Problems 1 and 2 presented in Sect. 5.2 open a new way to study relative t-designs in H(n, 2). We conclude our paper listing several open problems.