On eigenvalues of Seidel matrices and Haemers’ conjecture

For a graph G, let S(G) be the Seidel matrix of G and \({\theta }_1(G),\ldots ,{\theta }_n(G)\) be the eigenvalues of S(G). The Seidel energy of G is defined as \(|{\theta }_1(G)|+\cdots +|{\theta }_n(G)|\). Willem Haemers conjectured that the Seidel energy of any graph with n vertices is at least \(2n-2\), the Seidel energy of the complete graph with n vertices. Motivated by this conjecture, we prove that for any \(\alpha \) with \(0<\alpha <2,|{\theta }_1(G)|^\alpha +\cdots +|{\theta }_n(G)|^\alpha \geqslant (n-1)^\alpha +n-1\) if and only if \(|\hbox {det}\,S(G)|\geqslant n-1\). This, in particular, implies the Haemers’ conjecture for all graphs G with \(|\hbox {det}\,S(G)|\geqslant n-1\). A computation on the fraction of graphs with \(|\hbox {det}\,S(G)|<n-1\) is reported. Motivated by that, we conjecture that almost all graphs G of order n satisfy \(|\hbox {det}\,S(G)|\geqslant n-1\). In connection with this conjecture, we note that almost all graphs of order n have a Seidel energy of order \(\Theta (n^{3/2})\). Finally, we prove that self-complementary graphs G of order \(n\equiv 1\pmod 4\) have \(\det S(G)=0\).     

Packing coloring of Sierpiński-type graphs

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 \{1,\ldots ,k\}\), where each \(V_i\) is an i-packing. In this paper, we consider the packing chromatic number of several families of Sierpiński-type graphs. While it is known that this number is bounded from above by 8 in the family of Sierpiński graphs with base 3, we prove that it is unbounded in the families of Sierpiński graphs with bases greater than 3. On the other hand, we prove that the packing chromatic number in the family of Sierpiński triangle graphs \(ST^n_3\) is bounded from above by 31. Furthermore, we establish or provide bounds for the packing chromatic numbers of generalized Sierpiński graphs \(S^n_G\) with respect to all connected graphs G of order 4.     

Vizing Bound for the Chromatic Number on Some Graph Classes

We are interested in hereditary classes of graphs \({\mathcal {G}}\) such that every graph \(G \in {\mathcal {G}}\) satisfies \(\varvec{\chi }(G) \le \omega (G) + 1\), where \(\chi (G)\) (\(\omega (G)\)) denote the chromatic (clique) number of G. This upper bound is called the Vizing bound for the chromatic number. Apart from perfect graphs few classes are known to satisfy the Vizing bound in the literature. We show that if G is (\(P_6, S_{1, 2, 2}\), diamond)-free, then \(\chi (G) \le \omega (G)+1\), and we give examples to show that the bound is sharp.     

Edge Roman Domination on Graphs

An edge Roman dominating function of a graph G is a function \(f:E(G) \rightarrow \{0,1,2\}\) satisfying the condition that every edge e with \(f(e)=0\) is adjacent to some edge \(e'\) with \(f(e')=2\). The edge Roman domination number of G, denoted by \(\gamma '_R(G)\), is the minimum weight \(w(f) = \sum _{e\in E(G)} f(e)\) of an edge Roman dominating function f of G. This paper disproves a conjecture of Akbari, Ehsani, Ghajar, Jalaly Khalilabadi and Sadeghian Sadeghabad stating that if G is a graph of maximum degree \(\Delta \) on n vertices, then \(\gamma _R'(G) \le \lceil \frac{\Delta }{\Delta +1} n \rceil \). While the counterexamples having the edge Roman domination numbers \(\frac{2\Delta -2}{2\Delta -1} n\), we prove that \(\frac{2\Delta -2}{2\Delta -1} n + \frac{2}{2\Delta -1}\) is an upper bound for connected graphs. Furthermore, we provide an upper bound for the edge Roman domination number of k-degenerate graphs, which generalizes results of Akbari, Ehsani, Ghajar, Jalaly Khalilabadi and Sadeghian Sadeghabad. We also prove a sharp upper bound for subcubic graphs. In addition, we prove that the edge Roman domination numbers of planar graphs on n vertices is at most \(\frac{6}{7}n\), which confirms a conjecture of Akbari and Qajar. We also show an upper bound for graphs of girth at least five that is 2-cell embeddable in surfaces of small genus. Finally, we prove an upper bound for graphs that do not contain \(K_{2,3}\) as a subdivision, which generalizes a result of Akbari and Qajar on outerplanar graphs.     

On estimation of delay location

Assume that we observe a stationary Gaussian process X(t), \({t \in [-r, T]}\) , which satisfies the affine stochastic delay differential equation

$d X(t) = \int\limits_{[-r,0]}X(t+u)\, a_\vartheta (du)\,dt +dW(t), \quad t\ge 0,$

where W(t), t ≥ 0, is a standard Wiener process independent of X(t), \({t\in [-r, 0]}\) , and \({a_\vartheta}\) is a finite signed measure on [?r, 0], \({\vartheta\in\Theta}\) . The parameter \({\vartheta}\) is unknown and has to be estimated based on the observation. In this paper we consider the case where \({\Theta=(\vartheta_0,\vartheta_1)}\) , \({-\infty\,<\,\vartheta_0 <0 \,<\,\vartheta_1\,<\,\infty}\) , and the measures \({a_\vartheta}\) are of the form

$a_\vartheta = a+b_\vartheta-b,$

where a and b are finite signed measure on [?r, 0] and \({b_\vartheta}\) is the translate of b by \({\vartheta}\) . We study the limit behaviour of the normalized likelihoods

$Z_{T,\vartheta}(u) = \frac{dP_T^{\vartheta+\delta_T u}}{dP_T^\vartheta}$

as T→ ∞, where \({P_T^\vartheta}\) is the distribution of the observation if the true value of the parameter is \({\vartheta}\) . A necessary and sufficient condition for the existence of a rescaling function δ _T such that \({Z_{T,\vartheta}(u)}\) converges in distribution to an appropriate nondegenerate limiting function \({Z_{\vartheta}(u)}\) is found. It turns out that then the limiting function \({Z_{\vartheta}(u)}\) is of the form

$Z_\vartheta(u)=\exp\left(B^H(u) - E[B^H(u)]^2/2\right),$

where \({H\in[1/2,1]}\) and B ^H (u), \({u\in\mathbb{R}}\) , is a fractional Brownian motion with index H, and δ _T  = T ^?1/(2H) ?(T) with a slowly varying function ?. Every \({H\in[1/2,1]}\) may occur in this framework. As a consequence, the asymptotic behaviour of maximum likelihood and Bayes estimators is found.

     

Upper Bounds for the Paired-Domination Numbers of Graphs

A set \(S\subseteq V\) is a paired-dominating set if every vertex in \(V{\setminus } S\) has at least one neighbor in S and the subgraph induced by S contains a perfect matching. The paired-domination number of a graph G, denoted by \(\gamma _{pr}(G)\), is the minimum cardinality of a paired-dominating set of G. A conjecture of Goddard and Henning says that if G is not the Petersen graph and is a connected graph of order n with minimum degree \(\delta (G)\ge 3\), then \(\gamma _{pr}(G)\le 4n/7\). In this paper, we confirm this conjecture for k-regular graphs with \(k\ge 4\).     

Cliques in $$C_4$$-free graphs of large minimum degree

A graph G is called \(C_4\)-free if it does not contain the cycle \(C_4\) as an induced subgraph. Hubenko, Solymosi and the first author proved (answering a question of Erd?s) a peculiar property of \(C_4\)-free graphs: \(C_4\)-free graphs with n vertices and average degree at least cn contain a complete subgraph (clique) of size at least \(c'n\) (with \(c'= 0.1c^2\)). We prove here better bounds \(\big ({c^2n\over 2+c}\) in general and \((c-1/3)n\) when \( c \le 0.733\big )\) from the stronger assumption that the \(C_4\)-free graphs have minimum degree at least cn. Our main result is a theorem for regular graphs, conjectured in the paper mentioned above: 2k-regular \(C_4\)-free graphs on \(4k+1\) vertices contain a clique of size \(k+1\). This is the best possible as shown by the kth power of the cycle \(C_{4k+1}\).     

Packing Chromatic Number of Base-3 Sierpiński Graphs

The packing chromatic number \(\chi _{\rho }(G)\) of a graph G is the smallest integer k such that there exists a k-vertex coloring of G in which any two vertices receiving color i are at distance at least \(i+1\). Let \(S^n\) be the base-3 Sierpiński graph of dimension n. It is proved that \(\chi _{\rho }(S^1) = 3\), \(\chi _{\rho }(S^2) = 5\), \(\chi _{\rho }(S^3) = \chi _{\rho }(S^4) = 7\), and that \(8\le \chi _\rho (S^n) \le 9\) holds for any \(n\ge 5\).     

Hadwiger’s conjecture for uncountable graphs

We consider the infinite form of Hadwiger’s conjecture. We give a(n apparently novel) proof of Halin’s 1967 theorem stating that every graph X with coloring number \(>\kappa \) (specifically with chromatic number \(>\kappa \)) contains a subdivision of \(K_\kappa \). We also prove that there is a graph of cardinality \(2^\kappa \) and chromatic number \(\kappa ^+\) which does not contain \(K_{\kappa ^+}\) as a minor. Further, it is consistent that every graph of size and chromatic number \(\aleph _1\) contains a subdivision of \(K_{\aleph _1}\).     

A Tight Upper Bound on Acquaintance Time of Graphs

In this note we confirm a conjecture raised by Benjamini et al. (SIAM J Discrete Math 28(2):767–785, 2014) on the acquaintance time of graphs, proving that for all graphs G with n vertices it holds that \(\mathcal {AC}(G) = O(n^{3/2})\). This is done by proving that for all graphs G with n vertices and maximum degree \(\varDelta \) it holds that \(\mathcal {AC}(G) \le 20 \varDelta n\). Combining this with the bound \(\mathcal {AC}(G) \le O(n^2/\varDelta )\) from Benjamini et al. (SIAM J Discrete Math 28(2):767–785, 2014) gives the uniform upper bound of \(O(n^{3/2})\) for all n-vertex graphs. This bound is tight up to a multiplicative constant. We also prove that for the n-vertex path \(P_n\) it holds that \(\mathcal {AC}(P_n)=n-2\). In addition we show that the barbell graph \(B_n\) consisting of two cliques of sizes \({\lceil n/2\rceil }\) and \({\lfloor n/2\rfloor }\) connected by a single edge also has \(\mathcal {AC}(B_n) = n-2\). This shows that it is possible to add \(\varOmega (n^2\)) edges a graph without changing its \(\mathcal {AC}\) value.     

Counterexamples to the B-spline Conjecture for Gabor Frames

The frame set conjecture for B-splines \(B_n\), \(n \ge 2\), states that the frame set is the maximal set that avoids the known obstructions. We show that any hyperbola of the form \(ab=r\), where r is a rational number smaller than one and a and b denote the sampling and modulation rates, respectively, has infinitely many pieces, located around \(b=2,3,\dots \), not belonging to the frame set of the nth order B-spline. This, in turn, disproves the frame set conjecture for B-splines. On the other hand, we uncover a new region belonging to the frame set for B-splines \(B_n\), \(n \ge 2\).     

Structural Properties of Word Representable Graphs

Given a word \(w=w_1w_2\cdots w_n\) of length n over an ordered alphabet \(\Sigma _k\), we construct a graph \(G(w)=(V(w), E(w))\) such that V(w) has n vertices labeled \(1, 2,\ldots , n\) and for \(i, j \in V(w)\), \((i, j) \in E(w)\) if and only if \(w_iw_j\) is a scattered subword of w of the form \(a_{t}a_{t+1}\), \(a_t \in \Sigma _k\), for some \(1 \le t \le k-1\) with the ordering \(a_t<a_{t+1}\). A graph is said to be Parikh word representable if there exists a word w over \(\Sigma _k\) such that \(G=G(w)\). In this paper we characterize all Parikh word representable graphs over the binary alphabet in terms of chordal bipartite graphs. It is well known that the graph isomorphism (GI) problem for chordal bipartite graph is GI complete. The GI problem for a subclass of (6, 2) chordal bipartite graphs has been addressed. The notion of graph powers is a well studied topic in graph theory and its applications. We also investigate a bipartite analogue of graph powers of Parikh word representable graphs. In fact we show that for G(w), \(G(w)^{[3]}\) is a complete bipartite graph, for any word w over binary alphabet.     

Local asymptotic normality for shape and periodicity in the drift of a time inhomogeneous diffusion

We consider a one-dimensional diffusion whose drift contains a deterministic periodic signal with unknown periodicity T and carrying some unknown d-dimensional shape parameter \(\vartheta \). We prove local asymptotic normality (LAN) jointly in \(\vartheta \) and T for the statistical experiment arising from continuous observation of this diffusion. The local scale turns out to be \(n^{-1/2}\) for the shape parameter and \(n^{-3/2}\) for the periodicity which generalizes known results about LAN when either \(\vartheta \) or T is assumed to be known.     

Some Triangulated Surfaces without Balanced Splitting

Let G be the graph of a triangulated surface \(\varSigma \) of genus \(g\ge 2\). A cycle of G is splitting if it cuts \(\varSigma \) into two components, neither of which is homeomorphic to a disk. A splitting cycle has type k if the corresponding components have genera k and \(g-k\). It was conjectured that G contains a splitting cycle (Barnette 1982). We confirm this conjecture for an infinite family of triangulations by complete graphs but give counter-examples to a stronger conjecture (Mohar and Thomassen in Graphs on surfaces. Johns Hopkins studies in the mathematical sciences. Johns Hopkins University Press, Baltimore, 2001) claiming that G should contain splitting cycles of every possible type.     

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.     

Sets of minimal distances and characterizations of class groups of Krull monoids

Let H be a Krull monoid with finite class group G such that every class contains a prime divisor. Then every non-unit \(a \in H\) can be written as a finite product of atoms, say \(a=u_1 \cdot \ldots \cdot u_k\). The set \(\mathsf L (a)\) of all possible factorization lengths k is called the set of lengths of a. There is a constant \(M \in \mathbb N\) such that all sets of lengths are almost arithmetical multiprogressions with bound M and with difference \(d \in \Delta ^* (H)\), where \(\Delta ^* (H)\) denotes the set of minimal distances of H. We study the structure of \(\Delta ^* (H)\) and establish a characterization when \(\Delta ^*(H)\) is an interval. The system \(\mathcal L (H) = \{ \mathsf L (a) \mid a \in H \}\) of all sets of lengths depends only on the class group G, and a standing conjecture states that conversely the system \(\mathcal L (H)\) is characteristic for the class group. We confirm this conjecture (among others) if the class group is isomorphic to \(C_n^r\) with \(r,n \in \mathbb N\) and \(\Delta ^*(H)\) is not an interval.     

Toy Teichmüller spaces of real dimension 2: the pentagon and the punctured triangle

Let \(f: S\longrightarrow B\) be a non-trivial fibration from a complex projective smooth surface S to a smooth curve B of genus b. Let \(c_f\) the Clifford index of the general fibre F of f. In Barja et al. (Journal für die reine und angewandte Mathematik, 2016) it is proved that the relative irregularity of f, \(q_f=h^{1,0}(S)-b\) is less or equal than or equal to \(g(F)-c_f\). In particular this proves the (modified) Xiao’s conjecture: \(q_f\le \frac{g(F)}{2} +1\) for fibrations of general Clifford index. In this short note we assume that the general fiber of f is a plane curve of degree \(d\ge 5\) and we prove that \(q_f\le g(F)-c_f-1\). In particular we obtain the conjecture for families of quintic plane curves. This theorem is implied for the following result on infinitesimal deformations: let F a smooth plane curve of degree \(d\ge 5\) and let \(\xi \) be an infinitesimal deformation of F preserving the planarity of the curve. Then the rank of the cup-product map \(H^0(F,\omega _F) {\overset{ \cdot \xi }{\longrightarrow }} H^1(F,O_F)\) is at least \(d-3\). We also show that this bound is sharp.     

The Terwilliger algebra of the incidence graph of the Hamming graph

Let \(\varGamma \) be a distance-semiregular graph on Y, and let \(D^Y\) be the diameter of \(\varGamma \) on Y. Let \(\varDelta \) be the halved graph of \(\varGamma \) on Y. Fix \(x \in Y\). Let T and \(T'\) be the Terwilliger algebras of \(\varGamma \) and \(\varDelta \) with respect to x, respectively. Assume, for an integer i with \(1 \le 2i \le D^Y\) and for \(y,z \in \varGamma _{2i}(x)\) with \(\partial _{\varGamma }(y,z)=2\), the numbers \(|\varGamma _{2i-1}(x) \cap \varGamma (y) \cap \varGamma (z)|\) and \(|\varGamma _{2i+1}(x) \cap \varGamma (y) \cap \varGamma (z)|\) depend only on i and do not depend on the choice of y, z. The first goal in this paper is to show the relations between T-modules of \(\varGamma \) and \(T'\)-modules of \(\varDelta \). Assume \(\varGamma \) is the incidence graph of the Hamming graph H(D, n) on the vertex set Y and the set \({\mathcal {C}}\) of all maximal cliques. Then, \(\varGamma \) satisfies above assumption and \(\varDelta \) is isomorphic to H(D, n). The second goal is to determine the irreducible T-modules of \(\varGamma \). For each irreducible T-module W, we give a basis for W the action of the adjacency matrix on this basis and we calculate the multiplicity of W.     

Determination of cusp forms by central values of Rankin–Selberg <Emphasis Type="BoldItalic">L</Emphasis>-functions<Superscript>*</Superscript>

Let f be a fixed holomorphic Hecke eigen cusp form of weight k for \( SL\left( {2,{\mathbb Z}} \right) \), and let \( {\mathcal U} = \left\{ {{u_j}:j \geqslant 1} \right\} \) be an orthonormal basis of Hecke–Maass cusp forms for \( SL\left( {2,{\mathbb Z}} \right) \). We prove an asymptotic formula for the twisted first moment of the Rankin–Selberg L-functions \( L\left( {s,f \otimes {u_j}} \right) \) at \( s = \frac{1}{2} \) as u _j runs over \( {\mathcal U} \). It follows that f is uniquely determined by the central values of the family of Rankin–Selberg L-functions \( \left\{ {L\left( {s,f \otimes {u_j}} \right):{u_j} \in {\mathcal U}} \right\} \).     

Nonequilibrium statistical mechanics of a solid immersed in a continuum

We study actions of the symmetric group S₄ on K3 surfaces X that satisfy the following condition: there exists an equivariant birational contraction \(\bar r:X \to \bar X\) to a K3 surface \(\bar X\) with ADE singularities such that the quotient space \(\bar X\)/S₄ is isomorphic to P². We prove that up to smooth equivariant deformations there exist exactly 15 such actions of the group S₄ on K3 surfaces, and that these actions are realized as actions of the Galois groups on the Galoisations \(\bar X\) of the dualizing coverings of the plane which are associated with plane rational quartics without A₄, A₆, and E₆ singularities as their singular points.