Semisimple weakly symmetric pseudo-Riemannian manifolds

We develop the classification of weakly symmetric pseudo-Riemannian manifolds G / H where G is a semisimple Lie group and H is a reductive subgroup. We derive the classification from the cases where G is compact, and then we discuss the (isotropy) representation of H on the tangent space of G / H and the signature of the invariant pseudo-Riemannian metric. As a consequence we obtain the classification of semisimple weakly symmetric manifolds of Lorentz signature \((n-1,1)\) and trans-Lorentzian signature \((n-2,2)\).     

Normal coverings of solvable groups

For a finite non cyclic group G, let γ(G) be the smallest integer k such that G contains k proper subgroups H ₁, . . . , H _k with the property that every element of G is contained in \({H_i^g}\) for some \({i \in \{1,\dots,k\}}\) and \({g \in G.}\) We prove that for every n ≥ 2, there exists a finite solvable group G with γ(G) = n.     

Packing chromatic number versus chromatic and clique number

The packing chromatic number \(\chi _{\rho }(G)\) of a graph G is the smallest integer k such that the vertex set of G can be partitioned into sets \(V_i\), \(i\in [k]\), where each \(V_i\) is an i-packing. In this paper, we investigate for a given triple (a, b, c) of positive integers whether there exists a graph G such that \(\omega (G) = a\), \(\chi (G) = b\), and \(\chi _{\rho }(G) = c\). If so, we say that (a, b, c) is realizable. It is proved that \(b=c\ge 3\) implies \(a=b\), and that triples \((2,k,k+1)\) and \((2,k,k+2)\) are not realizable as soon as \(k\ge 4\). Some of the obtained results are deduced from the bounds proved on the packing chromatic number of the Mycielskian. Moreover, a formula for the independence number of the Mycielskian is given. A lower bound on \(\chi _{\rho }(G)\) in terms of \(\Delta (G)\) and \(\alpha (G)\) is also proved.     

Classification of Klein four symmetric pairs of holomorphic type for $$\mathrm {E}_{6(-14)}$$

The author classifies Klein four symmetric pairs of holomorphic type for non-compact Lie group \(\mathrm {E}_{6(-14)}\), which gives a class of pairs \((G,G')\) of real reductive Lie group G and its reductive subgroup \(G'\) such that there exist irreducible unitary representations \(\pi \) of G, which are admissible upon restriction to \(G'\).     

Some infinite families of Ramsey ($${\varvec{P}}_\mathbf{3},{\varvec{P}}_{{\varvec{n}}}$$)-minimal trees

For any given two graphs G and H, the notation \(F\rightarrow \) (G, H) means that for any red–blue coloring of all the edges of F will create either a red subgraph isomorphic to G or a blue subgraph isomorphic to H. A graph F is a Ramsey (G, H)-minimal graph if \(F\rightarrow \) (G, H) but \(F-e\nrightarrow (G,H)\), for every \(e \in E(F)\). The class of all Ramsey (G, H)-minimal graphs is denoted by \(\mathcal {R}(G,H)\). In this paper, we construct some infinite families of trees belonging to \(\mathcal {R}(P_3,P_n)\), for \(n=8\) and 9. In particular, we give an algorithm to obtain an infinite family of trees belonging to \(\mathcal {R}(P_3,P_n)\), for \(n\ge 10\).     

A spectra comparison theorem and its applications

We give a sharp comparison between the spectra of two Riemannian manifolds (Y, g) and \((X,g_0)\) under the following assumptions: \((X,g_0)\) has bounded geometry, (Y, g) admits a continuous Gromov–Hausdorff \(\varepsilon \)-approximation onto \((X,g_0)\) of non zero absolute degree, and the volume of (Y, g) is almost smaller than the volume of \((X,g_0)\). These assumptions imply no restrictions on the local topology or geometry of (Y, g) in particular no curvature assumption is supposed or inferred.     

Variants of theorems of Schur,Baer and Hall

If a group G is ‘restricted’ modulo its hypercentre, then to what extent does G have an equally restricted normal subgroup L with G / L hypercentral? We consider these questions where restricted means finite-\(\pi \), Chernikov, locally finite-\(\pi \), polycyclic or polycyclic-by-finite.     

Combinatorial constructions of optimal (<Emphasis Type="Italic">m</Emphasis>, <Emphasis Type="Italic">n</Emphasis>, 4, 2) optical orthogonal signature pattern codes

Optical orthogonal signature pattern codes (OOSPCs) play an important role in a novel type of optical code division multiple access (OCDMA) network for 2-dimensional image transmission. There is a one-to-one correspondence between an \((m, n, w, \lambda )\)-OOSPC and a \((\lambda +1)\)-(mn, w, 1) packing design admitting a point-regular automorphism group isomorphic to \({\mathbb {Z}}_m\times {\mathbb {Z}}_n\). In 2010, Sawa gave the first infinite class of (m, n, 4, 2)-OOSPCs by using S-cyclic Steiner quadruple systems. In this paper, we use various combinatorial designs such as strictly \({\mathbb {Z}}_m\times {\mathbb {Z}}_n\)-invariant s-fan designs, strictly \({\mathbb {Z}}_m\times {\mathbb {Z}}_n\)-invariant G-designs and rotational Steiner quadruple systems to present some constructions for (m, n, 4, 2)-OOSPCs. As a consequence, our new constructions yield more infinite families of optimal (m, n, 4, 2)-OOSPCs. Especially, we see that in some cases an optimal (m, n, 4, 2)-OOSPC can not achieve the Johnson bound. We also use Witt’s inversive planes to obtain optimal \((p, p, p+1, 2)\)-OOSPCs for all primes \(p\ge 3\).     

Congruences for Andrews’ (<Emphasis Type="Italic">k</Emphasis>, <Emphasis Type="Italic">i</Emphasis>)-singular overpartitions

Andrews recently defined new combinatorial objects which he called (k, i)-singular overpartitions and proved that they are enumerated by \(\overline{C}_{k,i}(n)\) which is the number of overpartitions of n in which no part is divisible by k and only the parts \(\equiv \pm i \pmod {k}\) may be overlined. Andrews further showed that \(\overline{C}_{3,1}(n)\) satisfies some Ramanujan-type congruences modulo 3. In this paper, we show that for any pair (k, i), \(\overline{C}_{k,i}(n)\) satisfies infinitely many Ramanujan-type congruences modulo any power of prime coprime to 6k. We also show that for an infinite family of k, the value \(\overline{C}_{3k,k}(n)\) is almost always even. Finally, we investigate the parity of \(\overline{C}_{4k,k}\).     

Construction of a (<Emphasis Type="Italic">k</Emphasis>, <Emphasis Type="Italic">n</Emphasis>)-visual cryptography scheme

In this paper we give an explicit construction of basis matrices for a (k, n)-visual cryptography scheme \((k,n){\hbox {-}}\mathrm{VCS}\) for integers k and n with \(2\le k \le n\). In balanced VCS every set of participants with equal cardinality has same relative contrast. The VCS constructed in this paper is a balanced \((k,n){\hbox {-}}\mathrm{VCS}\) for general k. Also we obtain a formula for pixel expansion and relative contrast. We also prove that our construction gives optimal contrast and minimum pixel expansion when \(k=n\) and \(n-1\).     

On the least distance eigenvalues of the second power of a graph

The k-th power of a graph G, denoted by \(G^k\), is the graph obtained from G by adding an edge between each pair of vertices with distance at most k. This paper investigates the least distance eigenvalues of the second power of a connected graph, and determine the trees and unicyclic graphs with least distance eigenvalues of the second power in \([-\,3,-\,2]\) and \((-\,\frac{3+\sqrt{5}}{2}, -\,1]\), respectively.     

On the minimum-cost $$\lambda $$-edge-connected k-subgraph problem

In this paper, we propose several integer programming (IP) formulations to exactly solve the minimum-cost \(\lambda \)-edge-connected k-subgraph problem, or the \((k,\lambda )\)-subgraph problem, based on its graph properties. Special cases of this problem include the well-known k-minimum spanning tree problem (if \(\lambda =1\)), \(\lambda \)-edge-connected spanning subgraph problem (if \(k=|V|\)) and k-clique problem (if \(\lambda = k-1\) and there are exact k vertices in the subgraph). As a generalization of k-minimum spanning tree and a case of the \((k,\lambda )\)-subgraph problem, the (k, 2)-subgraph problem is studied, and some special graph properties are proved to find stronger and more compact IP formulations. Additionally, we study the valid inequalities for these IP formulations. Numerical experiments are performed to compare proposed IP formulations and inequalities.     

The distortion dimension of $$\mathbb $$-rank 1 lattices

Let \(X=G/K\) be a symmetric space of noncompact type and rank \(k\ge 2\). We prove that horospheres in X are Lipschitz \((k-2)\)-connected if their centers are not contained in a proper join factor of the spherical building of X at infinity. As a consequence, the distortion dimension of an irreducible \(\mathbb {Q}\)-rank-1 lattice \(\Gamma \) in a linear, semisimple Lie group G of \(\mathbb R\)-rank k is \(k-1\). That is, given \(m< k-1\), a Lipschitz m-sphere S in (a polyhedral complex quasi-isometric to) \(\Gamma \), and a \((m+1)\)-ball B in X (or G) filling S, there is a \((m+1)\)-ball \(B'\) in \(\Gamma \) filling S such that \({{\mathrm{vol}}}B'\sim {{\mathrm{vol}}}B\). In particular, such arithmetic lattices satisfy Euclidean isoperimetric inequalities up to dimension \(k-1\).     

Complexities of normal bases constructed from Gauss periods

Let q be a power of a prime p, and let \(r=nk+1\) be a prime such that \(r\not \mid q\), where n and k are positive integers. Under a simple condition on q, r and k, a Gauss period of type (n, k) is a normal element of \({\mathbb {F}}_{q}^{n}\) over \({\mathbb {F}}_q\); the complexity of the resulting normal basis of \({\mathbb {F}}_{q}^{n}\) over \({\mathbb {F}}_q\) is denoted by C(n, k; p). Recent works determined C(n, k; p) for \(k\le 7\) and all qualified n and q. In this paper, we show that for any given \(k>0\), C(n, k; p) is given by an explicit formula except for finitely many primes \(r=nk+1\) and the exceptional primes are easily determined. Moreover, we describe an algorithm that allows one to compute C(n, k; p) for the exceptional primes \(r=nk+1\). Our numerical results cover C(n, k; p) for \(k\le 20\) and all qualified n and q.     

Continuous reducibility and dimension of metric spaces

If (X, d) is a Polish metric space of dimension 0, then by Wadge’s lemma, no more than two Borel subsets of X are incomparable with respect to continuous reducibility. In contrast, our main result shows that for any metric space (X, d) of positive dimension, there are uncountably many Borel subsets of (X, d) that are pairwise incomparable with respect to continuous reducibility. In general, the reducibility that is given by the collection of continuous functions on a topological space \((X,\tau )\) is called the Wadge quasi-order for \((X,\tau )\). As an application of the main result, we show that this quasi-order, restricted to the Borel subsets of a Polish space \((X,\tau )\), is a well-quasiorder if and only if \((X,\tau )\) has dimension 0. Moreover, we give further examples of applications of the construction of graph colorings that is used in the proofs.     

Interassociates of the bicyclic semigroup

An interassociate of a semigroup \((S,\cdot )\) is a semigroup \((S, *)\) such that for all \(a, b, c \in S\), \(a\cdot (b*c)=(a\cdot b) *c\) and \(a*(b\cdot c)=(a*b) \cdot c\). We investigate the bicyclic semigroup C and its interassociates. In particular, if p and q are the generators of the bicyclic semigroup and m and n are fixed nonnegative integers, the operation \(a*_{m,n} b= aq^mp^n b\) is known to be an interassociate. We show that for distinct pairs (m, n) and (s, t), the interassociates \((C, *_{m,n})\) and \((C, *_{s,t})\) are not isomorphic. We also generalize a result regarding homomorphisms on C to homomorphisms on its interassociates.     

2-Domination number of generalized Petersen graphs

Let \(G=(V,E)\) be a graph. A subset \(S\subseteq V\) is a k-dominating set of G if each vertex in \(V-S\) is adjacent to at least k vertices in S. The k-domination number of G is the cardinality of the smallest k-dominating set of G. In this paper, we shall prove that the 2-domination number of generalized Petersen graphs \(P(5k+1, 2)\) and \(P(5k+2, 2)\), for \(k>0\), is \(4k+2\) and \(4k+3\), respectively. This proves two conjectures due to Cheng (Ph.D. thesis, National Chiao Tung University, 2013). Moreover, we determine the exact 2-domination number of generalized Petersen graphs P(2k, k) and \(P(5k+4,3)\). Furthermore, we give a good lower and upper bounds on the 2-domination number of generalized Petersen graphs \(P(5k+1, 3), P(5k+2,3)\) and \(P(5k+3, 3).\)     

On $$\mathfrak {F}_{hq}$$-supplemented subgroups of a finite group

A subgroup H of a finite group G is quasinormal in G if it permutes with every subgroup of G. A subgroup H of a finite group G is \(\mathfrak {F}_{hq}\)-supplemented in G if G has a quasinormal subgroup N such that HN is a Hall subgroup of G and \((H\cap N)H_{G}/ H_{G} \le Z_{\mathfrak {F}}(G/H_{G})\), where \(H_{G}\) is the core of H in G and \({Z}_{\mathfrak {F}} (G/H_{G})\) is the \(\mathfrak {F}\)-hypercenter of \({G/H}_{G}\). This paper concerns the structure of a finite group G under the assumption that some subgroups of G are \(\mathfrak {F}_{hq}\)-supplemented in G.     

Optimal channel assignment and <Emphasis Type="Italic">L</Emphasis>(<Emphasis Type="Italic">p</Emphasis>, 1)-labeling

The optimal channel assignment is an important optimization problem with applications in optical networks. This problem was formulated to the L(p, 1)-labeling of graphs by Griggs and Yeh (SIAM J Discrete Math 5:586–595, 1992). A k-L(p, 1)-labeling of a graph G is a function \(f:V(G)\rightarrow \{0,1,2,\ldots ,k\}\) such that \(|f(u)-f(v)|\ge p\) if \(d(u,v)=1\) and \(|f(u)-f(v)|\ge 1\) if \(d(u,v)=2\), where d(u, v) is the distance between the two vertices u and v in the graph. Denote \(\lambda _{p,1}^l(G)= \min \{k \mid G\) has a list k-L(p, 1)-labeling\(\}\). In this paper we show upper bounds \(\lambda _{1,1}^l(G)\le \Delta +9\) and \(\lambda _{2,1}^l(G)\le \max \{\Delta +15,29\}\) for planar graphs G without 4- and 6-cycles, where \(\Delta \) is the maximum vertex degree of G. Our proofs are constructive, which can be turned to a labeling (channel assignment) method to reach the upper bounds.     

Newman’s identity and infinite families of congruences modulo 7 for broken 3-diamond partitions

In 2007, Andrews and Paule introduced the notion of broken k-diamond partitions. Let \(\Delta _k(n)\) denote the number of broken k-diamond partitions of n for a fixed positive integer k. Recently, Paule and Radu presented some conjectures on congruences modulo 7 for \(\Delta _3(n)\) which were proved by Jameson and Xiong based on the theory of modular forms. Very recently, Xia proved several infinite families of congruences modulo 7 for \(\Delta _3(n)\) using theta function identities. In this paper, many new infinite families of congruences modulo 7 for \(\Delta _3(n)\) are derived based on an identity of Newman and the (p; k)-parametrization of theta functions due to Alaca, Alaca and Williams. In particular, some non-standard congruences modulo 7 for \(\Delta _3(n)\) are deduced. For example, we prove that for \(\alpha \ge 0\), \(\Delta _3\left( \frac{14\times 757^{\alpha }+1}{3}\right) \equiv 6 -\alpha \ (\mathrm{mod}\ 7)\).