Theta characteristics of hyperelliptic graphs

We study theta characteristics of hyperelliptic metric graphs of genus g with no bridge edges. These graphs have a harmonic morphism of degree two to a metric tree that can be lifted to a morphism of degree two of a hyperelliptic curve X over K to the projective line, with K an algebraically closed field of char\({(K) \not =2}\), complete with respect to a non-Archimedean valuation, with residue field k of char\({(k)\not=2}\). The hyperelliptic curve has \({2^{2g}}\) theta characteristics. We show that for each effective theta characteristic on the graph, \({2^{g-1}}\) even and \({2^{g-1}}\) odd theta characteristics on the curve specialize to it; and \({2^g}\) even theta characteristics on the curve specialize to the unique not effective theta characteristics on the graph.     

Total Rainbow Connection Number and Complementary Graph

A vertex-colored graph G is rainbow vertex connected if any two distinct vertices are connected by a path whose internal vertices have distinct colors. The rainbow vertex connection number of G, denoted by rvc(G), is the smallest number of colors that are needed in order to make G rainbow vertex connected. In this paper, we prove that for a connected graph G, if \({{\rm diam}(\overline{G}) \geq 3}\), then \({{\rm rvc}(G) \leq 2}\), and this bound is tight. Next, we obtain that for a triangle-free graph \({\overline{G}}\) with \({{\rm diam}(\overline{G}) = 2}\), if G is connected, then \({{\rm rvc}(G) \leq 2}\), and this bound is tight. A total-colored path is total rainbow if its edges and internal vertices have distinct colors. A total-colored graph G is total rainbow connected if any two distinct vertices are connected by some total rainbow path. The total rainbow connection number of G, denoted by trc(G), is the smallest number of colors required to color the edges and vertices of G in order to make G total rainbow connected. In this paper, we prove that for a triangle-free graph \({\overline{G}}\) with \({{\rm diam}(\overline{G}) = 3}\), if G is connected, then trc\({(G) \leq 5}\), and this bound is tight. Next, a Nordhaus–Gaddum-type result for the total rainbow connection number is provided. We show that if G and \({\overline{G}}\) are both connected, then \({6 \leq {\rm trc} (G) + {\rm trc}(\overline{G}) \leq 4n - 6.}\) Examples are given to show that the lower bound is tight for \({n \geq 7}\) and n = 5. Tight lower bounds are also given for n = 4, 6.     

Minimal tiled orders of finite global dimension

In this paper, we consider the sequence of balancing and Lucas balancing numbers. The balancing numbers \({B_n}\) are given by the recurrence \({B_n = 6 B_{n-1} - B_{n-2}}\) with initial conditions \({B_0 = 0, B_1 = 1}\) and its associated Lucas balancing numbers \({C_n}\) are given by the recurrence \({C_n = 6 C_{n-1} - C_{n-2}}\) with initial conditions \({C_0 = 1, C_1 = 3}\). First we find the perfect powers in the sequence of balancing and Lucas balancing numbers. We also identify those Lucas balancing numbers which are products of a power of 3 and a perfect power. Using this property of Lucas balancing numbers, we solve a conjecture regarding the non-existence of positive integral solution (x, y) for the Diophantine equation \({2x^2 + 1 = 3^b y^m}\) for any even positive integers b and m with \({m > 2}\), given in (Int J Number Theory 11:1259–1274, 2015). Also we prove that the Diophantine equations \({B_n B_{n+d}\ldots B_{n+(k-1)d} = y^m}\) and \({C_n C_{n+d}\ldots C_{n+(k-1)d} = y^m}\) have no solution for any positive integers n, d, k, y, and m with \({m \geq 2, y \geq 2}\) and gcd\({(n,d) = 1}\).     

A characterization of double coverings of curves

The gonality sequence \({(d_{r})_{r}}\) of a curve X of genus g which doubly covers a curve of genus h satisfies \({d_{r} = 2(r + h)}\) for all \({r = h, h + 1, \ldots, g - 3h}\) provided that \({g \gg h}\). In this paper we explore if this striking feature of \({(d_{r})_{r}}\) actually characterizes such a covering.     

The “strange term” in the periodic homogenization for multivalued Leray–Lions operators in perforated domains

Using the periodic unfolding method of Cioranescu, Damlamian and Griso, we study the homogenization for equations of the form

$-{\rm div}\,\,d_\varepsilon=f,\,\,{\rm with}\,\,\left(\nabla u_{\varepsilon , \delta }(x),d_{\varepsilon , \delta }(x)\right) \in A_\varepsilon(x)$

in a perforated domain with holes of size \({\varepsilon \delta }\) periodically distributed in the domain, where \({A_\varepsilon }\) is a function whose values are maximal monotone graphs (on R ^N ). Two different unfolding operators are involved in such a geometric situation. Under appropriate growth and coercivity assumptions, if the corresponding two sequences of unfolded maximal monotone graphs converge in the graph sense to the maximal monotone graphs A(x, y) and A ₀(x, z) for almost every \({(x,y,z)\in \Omega \times Y \times {\rm {\bf R}}^N}\), as \({\varepsilon \to 0}\), then every cluster point (u ₀, d ₀) of the sequence \({(u_{\varepsilon , \delta }, d_{\varepsilon , \delta } )}\) for the weak topology in the naturally associated Sobolev space is a solution of the homogenized problem which is expressed in terms of u ₀ alone. This result applies to the case where \({A_{\varepsilon}(x)}\) is of the form \({B(x/\varepsilon)}\) where B(y) is periodic and continuous at y = 0, and, in particular, to the oscillating p-Laplacian.

     

Another characterization of the upper nil radical

In 2015 Halina France-Jackson introduced the notion of a \({\sigma}\)-ring i.e. a ring R with the property that if I and J are ideals of R and for all \({i\in I}\), \({{j\in J}}\), there exist natural numbers m, n such that \({i^{m}j^{n} =0}\), then I = 0 or J = 0. It is shown that \({\sigma}\) is a special class which coincides with the class \({\rho}\) of all prime nil-semisimple rings. This implies that the upper nil radical of any ring R is the intersection of all ideals I of the ring such that R/I is a \({\sigma}\)-ring. In this paper we introduce classes of rings equivalent to the \({\sigma}\)-rings and then give characterizations of the upper nil radical in terms of these rings.     

Depth,Stanley depth,and regularity of ideals associated to graphs

Let \({\mathbb{K}}\) be a field and \({S=\mathbb{K}[x_1,\dots,x_n]}\) be the polynomial ring in n variables over \({\mathbb{K}}\). Let G be a graph with n vertices. Assume that \({I=I(G)}\) is the edge ideal of G and \({J=J(G)}\) is its cover ideal. We prove that \({{\rm sdepth}(J)\geq n-\nu_{o}(G)}\) and \({{\rm sdepth}(S/J)\geq n-\nu_{o}(G)-1}\), where \({\nu_{o}(G)}\) is the ordered matching number of G. We also prove the inequalities \({{\rmsdepth}(J^k)\geq {\rm depth}(J^k)}\) and \({{\rm sdepth}(S/J^k)\geq {\rmdepth}(S/J^k)}\), for every integer \({k\gg 0}\), when G is a bipartite graph. Moreover, we provide an elementary proof for the known inequality reg\({(S/I)\leq \nu_{o}(G)}\).     

On stable Baire classes

We introduce and study adhesive spaces. Using this concept we obtain a characterization of stable Baire maps \({f : X\to Y}\) of the class \({\alpha}\) for wide classes of topological spaces. In particular, we prove that for a topological space X and a contractible space Y a map \({f : X \to Y}\) belongs to the nth stable Baire class if and only if there exist a sequence \({(f_k)_{k=1}^\infty}\) of continuous maps \({f_k : {X \to Y}}\) and a sequence \({(F_k)_{k=1}^\infty}\) of functionally ambiguous sets of the nth class in X such that \({f|_{F_k}=f_k|_{F_k}}\) for every k. Moreover, we show that every monotone function \({f : \mathbb{R} \to \mathbb{R}}\) is of the \({\alpha}\) th stable Baire class if and only if it belongs to the first stable Baire class.     

Distance mean-regular graphs

We introduce the concept of distance mean-regular graph, which can be seen as a generalization of both vertex-transitive and distance-regular graphs. Let \(\Gamma \) be a graph with vertex set V, diameter D, adjacency matrix \(\varvec{A}\), and adjacency algebra \(\mathcal{A}\). Then, \(\Gamma \) is distance mean-regular when, for a given \(u\in V\), the averages of the intersection numbers \(p_{ij}^h(u,v)=|\Gamma _i(u)\cap \Gamma _j(v)|\) (number of vertices at distance i from u and distance j from v) computed over all vertices v at a given distance \(h\in \{0,1,\ldots ,D\}\) from u, do not depend on u. In this work we study some properties and characterizations of these graphs. For instance, it is shown that a distance mean-regular graph is always distance degree-regular, and we give a condition for the converse to be also true. Some algebraic and spectral properties of distance mean-regular graphs are also investigated. We show that, for distance mean regular-graphs, the role of the distance matrices of distance-regular graphs is played for the so-called distance mean-regular matrices. These matrices are computed from a sequence of orthogonal polynomials evaluated at the adjacency matrix of \(\Gamma \) and, hence, they generate a subalgebra of \(\mathcal{A}\). Some other algebras associated to distance mean-regular graphs are also characterized.     

On the peripheral spectrum of positive elements

Let A be an ordered Banach algebra with a unit \(\mathbf{e}\) and a cone \(A^+\). An element p of A is said to be an order idempotent if \(p^2 = p\) and \(0 \le p\le \mathbf{e}\). An element \(a\in A^+\) is said to be irreducible if the relation \((\mathbf{e}-p)ap = 0\), where p is an order idempotent, implies \(p = 0\) or \(p = \mathbf{e}\). For an arbitrary element a of A the peripheral spectrum \(\sigma _\mathrm{per}(a)\) of a is the set \(\sigma _\mathrm{per}(a) = \{\lambda \in \sigma (a):|\lambda | = r(a)\}\), where \(\sigma (a)\) is the spectrum of a and r(a) is the spectral radius of a. We investigate properties of the peripheral spectrum of an irreducible element a. Conditions under which \(\sigma _\mathrm{per}(a)\) contains or coincides with \(r(a)H_m\), where \(H_m\) is the group of all \(m^\mathrm{th}\) roots of unity, and the spectrum \(\sigma (a)\) is invariant under rotation by the angle \(\frac{2\pi }{m}\) for some \(m\in {\mathbb N}\), are given. The correlation between these results and the existence of a cyclic form of a is considered. The conditions under which a is primitive, i.e., \(\sigma _\mathrm{per}(a) = \{r(a)\}\), are studied. The necessary assumptions on the algebra A which imply the validity of these results, are discussed. In particular, the Lotz–Schaefer axiom is introduced and finite-rank elements of A are defined. Other approaches to the notions of irreducibility and primitivity are discussed. Conditions under which the inequalities \(0 \le b < a\) imply \(r(b) < r(a)\) are studied. The closedness of the center \(A_\mathbf{e}\), i.e., of the order ideal generated by \(\mathbf{e}\) in A, is proved.     

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.     

Induced-Universal Graphs for Graphs with Bounded Maximum Degree

For a family \(\mathcal {F}\) of graphs, a graph U is induced-universal for \({\mathcal{F}}\) if every graph in \({\mathcal{F}}\) is an induced subgraph of U. We give a construction for an induced-universal graph for the family of graphs on n vertices with degree at most r, which has \(Cn^{\lfloor (r+1)/2\rfloor}\) vertices and \(Dn^{2\lfloor (r+1)/2\rfloor -1}\) edges, where C and D are constants depending only on r. This construction is nearly optimal when r is even in that such an induced-universal graph must have at least cn ^r/2 vertices for some c depending only on r.Our construction is explicit in that no probabilistic tools are needed to show that the graph exists or that a given graph is induced-universal. The construction also extends to multigraphs and directed graphs with bounded degree.     

Applications of strongly convergent sequences to Fourier series by means of modulus functions

The aim of this work is to estimate sums involving P(n), the largest prime factor of an integer \({n \geqq 2}\) under digital constraints \({{f(P(n)) \equiv a}{\rm mod} b}\), for every \({a \in \mathbb{Z}}\) and an integer \({b \geqq 2}\) where f is a strongly q-additive function with integer values (i.e. \({f(aq^j + b) = f(a) + f(b)}\), with \({(a, b, j) \in \mathbb{N}^3}\), \({{0 \leqq b} < q^j}\)). We also estimate the cardinality of the set \({\{{n \leqq x, f(P(n) + c)} \equiv {a {\rm mod} b}, P(n) \equiv l {\rm mod} k\}}\), where \({c \in \mathbb{Z}}\), \({k \geqq 2}\).     

Stable equilibria of a singularly perturbed reaction–diffusion equation when the roots of the degenerate equation contact or intersect along a non-smooth hypersurface

We use the variational concept of \({\Gamma}\)-convergence to prove existence, stability and exhibit the geometric structure of four families of stationary solutions to the singularly perturbed parabolic equation \({u_t=\epsilon^2 {\rm div}(k\nabla u)+f(u,x)}\), for \({(t,x)\in \mathbb{R}^+\times\Omega}\), where \({\Omega\subset\mathbb{R}^n}\), \({n\geq 1}\), supplied with no-flux boundary condition. The novelty here lies in the fact that the roots of the bistable function f are not isolated, meaning that the graphs of its roots are allowed to have contact or intersect each other along a Lipschitz-continuous (n ? 1)-dimensional hypersurface \({\gamma \subset \Omega}\); across this hypersurface, the stable equilibria may have corners. The case of intersecting roots stems from the phenomenon known as exchange of stability which is characterized by \({f(\cdot,x)}\) having only two roots.     

On the Metric Dimension of Imprimitive Distance-Regular Graphs

A resolving set for a graph \({\Gamma}\) is a collection of vertices S, chosen so that for each vertex v, the list of distances from v to the members of S uniquely specifies v. The metric dimension of \({\Gamma}\) is the smallest size of a resolving set for \({\Gamma}\). Much attention has been paid to the metric dimension of distance-regular graphs. Work of Babai from the early 1980s yields general bounds on the metric dimension of primitive distance-regular graphs in terms of their parameters. We show how the metric dimension of an imprimitive distance-regular graph can be related to that of its halved and folded graphs. We also consider infinite families (including Taylor graphs and the incidence graphs of certain symmetric designs) where more precise results are possible.     

The trace graph of the matrix ring over a finite commutative ring

Let R be a commutative ring and let \({n >1}\) be an integer. We introduce a simple graph, denoted by \({\Gamma_t(M_n(R))}\), which we call the trace graph of the matrix ring \({M_n(R)}\), such that its vertex set is \({M_n(R)^{\ast}}\) and such that two distinct vertices A and B are joined by an edge if and only if \({{\rm Tr} (AB)=0}\) where \({ {\rm Tr} (AB)}\) denotes the trace of the matrix AB. We prove that \({\Gamma_t(M_n(R))}\) is connected with \({{\rm diam}(\Gamma_{t}(M_{n}(R)))=2}\) and \({{\rm gr} (\Gamma_t(M_n(R)))=3}\). We investigate also the interplay between the ring-theoretic properties of R and the graph-theoretic properties of \({\Gamma_t(M_n(R))}\). Hence, we use the notion of the irregularity index of a graph to characterize rings with exactly one nontrivial ideal.     

On Euler characteristics of Selmer groups for abelian varieties over global function fields

Let F be a global function field of characteristic \({p > 0}\), \({K/F}\) an \({\ell}\)-adic Lie extension (\({ \ell \neq p}\)), and \({A/F}\) an abelian variety. We provide Euler characteristic formulas for the Gal\({(K/F)}\)-module \({Sel_A(K)_\ell}\).     

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}\).     

A generalization of zero divisor graphs associated to commutative rings

Let R be a commutative ring with a nonzero identity element. For a natural number n, we associate a simple graph, denoted by \(\Gamma ^n_R\), with \(R^n\backslash \{0\}\) as the vertex set and two distinct vertices X and Y in \(R^n\) being adjacent if and only if there exists an \(n\times n\) lower triangular matrix A over R whose entries on the main diagonal are nonzero and one of the entries on the main diagonal is regular such that \(X^TAY=0\) or \(Y^TAX=0\), where, for a matrix \(B, B^T\) is the matrix transpose of B. If \(n=1\), then \(\Gamma ^n_R\) is isomorphic to the zero divisor graph \(\Gamma (R)\), and so \(\Gamma ^n_R\) is a generalization of \(\Gamma (R)\) which is called a generalized zero divisor graph of R. In this paper, we study some basic properties of \(\Gamma ^n_ R\). We also determine all isomorphic classes of finite commutative rings whose generalized zero divisor graphs have genus at most three.     

A generalization of total graphs

Let R be a commutative ring with nonzero identity, \(L_{n}(R)\) be the set of all lower triangular \(n\times n\) matrices, and U be a triangular subset of \(R^{n}\), i.e., the product of any lower triangular matrix with the transpose of any element of U belongs to U. The graph \(GT^{n}_{U}(R^n)\) is a simple graph whose vertices consists of all elements of \(R^{n}\), and two distinct vertices \((x_{1},\dots ,x_{n})\) and \((y_{1},\dots ,y_{n})\) are adjacent if and only if \((x_{1}+y_{1}, \ldots ,x_{n}+y_{n})\in U\). The graph \(GT^{n}_{U}(R^n)\) is a generalization for total graphs. In this paper, we investigate the basic properties of \(GT^{n}_{U}(R^n)\). Moreover, we study the planarity of the graphs \(GT^{n}_{U}(U)\), \(GT^{n}_{U}(R^{n}{\setminus } U)\) and \(GT^{n}_{U}(R^n)\).