Graphs with small total rainbow connection number

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 investigate graphs with small total rainbow connection number. First, for a connected graph G, we prove that \({\text{trc(G) = 3 if}}\left( {\begin{array}{*{20}{c}}{n - 1} \\2\end{array}} \right) + 1 \leqslant \left| {{\text{E(G)}}} \right| \leqslant \left( {\begin{array}{*{20}{c}}n \\2\end{array}} \right) - 1\), and \({\text{trc(G)}} \leqslant {\text{6 if }}\left| {{\text{E(G)}}} \right| \geqslant \left( {\begin{array}{*{20}{c}}{n - 2} \\2\end{array}} \right) + 2\). Next, we investigate the total rainbow connection numbers of graphs G with |V(G)| = n, diam(G) ≥ 2, and clique number ω(G) = n ? s for 1 ≤ s ≤ 3. In this paper, we find Theorem 3 of [Discuss. Math. Graph Theory, 2011, 31(2): 313–320] is not completely correct, and we provide a complete result for this theorem.     

Rainbow Spanning Subgraphs of Small Diameter in Edge-Colored Complete Graphs

Let s(n, t) be the maximum number of colors in an edge-coloring of the complete graph \(K_n\) that has no rainbow spanning subgraph with diameter at most t. We prove \(s(n,t)={\left( {\begin{array}{c}n-2\\ 2\end{array}}\right) }+1\) for \(n,t\ge 3\), while \(s(n,2)={\left( {\begin{array}{c}n-2\\ 2\end{array}}\right) }+\left\lfloor {\frac{n-1}{2}}\right\rfloor \) for \(n\ne 4\) (and \(s(4,2)=2\)).     

On sums of binomial coefficients involving Catalan and Delannoy numbers modulo $$p^2$$

In this paper, we prove some congruences conjectured by Z.-W. Sun: For any prime \(p>3\), we determine

$$\begin{aligned} \sum \limits _{k = 0}^{p - 1} {\frac{{{C_k}C_k^{(2)}}}{{{{27}^k}}}} \quad {\text { and }}\quad \sum \limits _{k = 1}^{p - 1} {\frac{{\left( {\begin{array}{l} {2k} \\ {k - 1} \\ \end{array}} \right) \left( { \begin{array}{l} {3k} \\ {k - 1} \\ \end{array} } \right) }}{{{{27}^k}}}} \end{aligned}$$

modulo \(p^2\), where \(C_k=\frac{1}{k+1}\left( {\begin{array}{c}2k\\ k\end{array}}\right) \) is the k-th Catalan number and \(C_k^{(2)}=\frac{1}{2k+1}\left( {\begin{array}{c}3k\\ k\end{array}}\right) \) is the second-order Catalan numbers of the first kind. And we prove that

$$\begin{aligned} \sum _{k=1}^{p-1}\frac{D_k}{k}\equiv -q_p(2)+pq_p(2)^2\pmod {p^2}, \end{aligned}$$

where \(D_n=\sum _{k=0}^{n}\left( {\begin{array}{c}n\\ k\end{array}}\right) \left( {\begin{array}{c}n+k\\ k\end{array}}\right) \) is the n-th Delannoy number and \(q_p(2)=(2^{{p-1}}-1)/p\) is the Fermat quotient.

     

On Frankl and Füredi’s conjecture for 3-uniform hypergraphs

Frankl and Füredi in [1] conjectured that the r-graph with m edges formed by taking the first m sets in the colex ordering of N^(r) has the largest Lagrangian of all r-graphs with m edges. Denote this r-graph by C _r,m and the Lagrangian of a hypergraph by λ(G). In this paper, we first show that if \(\leqslant m \leqslant \left( {\begin{array}{*{20}{c}}t \\ 3 \end{array}} \right)\), G is a left-compressed 3-graph with m edges and on vertex set [t], the triple with minimum colex ordering in G ^c is (t ? 2 ? i)(t ? 2)t, then λ(G) ≤ λ(C _3,m ). As an implication, the conjecture of Frankl and Füredi is true for \(\left( {\begin{array}{*{20}{c}}t \\ 3\end{array}} \right) - 6 \leqslant m \leqslant \left( {\begin{array}{*{20}{c}}t \\ 3\end{array}} \right)\).     

The <Emphasis Type="Italic">p</Emphasis>-adic order of some fibonomial coefficients whose entries are powers of <Emphasis Type="Italic">p</Emphasis>

Let (F _n ) _n≥0 be the Fibonacci sequence. For 1 ≤ k ≤ m, the Fibonomial coefficient is defined as

$${\left[ {\begin{array}{*{20}{c}} m \\ k \end{array}} \right]_F} = \frac{{{F_{m - k + 1}} \cdots {F_{m - 1}}{F_m}}}{{{F_1} \cdots {F_k}}}$$

. In 2013, Marques, Sellers and Trojovský proved that if p is a prime number such that p ≡ ±2 (mod 5), then \(p{\left| {\left[ {\begin{array}{*{20}{c}} {{p^{a + 1}}} \\ {{p^a}} \end{array}} \right]} \right._F}\) for all integers a ≥ 1. In 2015, Marques and Trojovský worked on the p-adic order of \({\left[ {\begin{array}{*{20}{c}} {{p^{a + 1}}} \\ {{p^a}} \end{array}} \right]_F}\) for all a ≥ 1 when p ≠ 5. In this paper, we shall provide the exact p-adic order of \({\left[ {\begin{array}{*{20}{c}} {{p^{a + 1}}} \\ {{p^a}} \end{array}} \right]_F}\) for all integers a, b ≥ 1 and for all prime number p.

     

Families of Subsets Without a Given Poset in Double Chains and Boolean Lattices

Given a finite poset P, the intensively studied quantity La(n, P) denotes the largest size of a family of subsets of [n] not containing P as a weak subposet. Burcsi and Nagy (J. Graph Theory Appl. 1, 40–49 2013) proposed a double-chain method to get an upper bound \({\mathrm La}(n,P)\le \frac {1}{2}(|P|+h-2)\left (\begin {array}{c}n \\ \lfloor {n/2}\rfloor \end {array}\right )\) for any finite poset P of height h. This paper elaborates their double-chain method to obtain a new upper bound

$${\mathrm La}(n,P)\le \left( \frac{|P|+h-\alpha(G_{P})-2}{2}\right)\left( \begin{array}{c}n \\ \lfloor{\frac{n}{2}}\rfloor\end{array}\right) $$

for any graded poset P, where α(G _P ) denotes the independence number of an auxiliary graph defined in terms of P. This result enables us to find more posets which verify an important conjecture by Griggs and Lu (J. Comb. Theory (Ser. A) 119, 310–322, 2012).

     

On a Congruence Involving Generalized Fibonomial Coefficients

Let (F_n)_n≥0 be the Fibonacci sequence. For 1 ≤ k ≤ m, the Fibonomial coefficient is defined as

$${\left[ {\begin{array}{*{20}{c}} n \\ k \end{array}} \right]_F} = \frac{{{F_{n - k + 1}} \cdots {F_{n - 1}}{F_n}}}{{{F_1} \cdots {F_k}}}$$

. In 2013, Marques, Sellers and Trojovský proved that if p is a prime number such that p ≡ ±1 (mod 5), then p?\({\left[ {\begin{array}{*{20}{c}} {{p^{a + 1}}} \\ {{p^a}} \end{array}} \right]_F}\) for all integers a ≥ 1. In 2010, in particular, Kilic generalized the Fibonomial coefficients for

$${\left[ {\begin{array}{*{20}{c}} n \\ k \end{array}} \right]_{F,m}} = \frac{{{F_{\left( {n - k + 1} \right)m}} \cdots {F_{\left( {n - 1} \right)m}}{F_{nm}}}}{{{F_m} \cdots {F_{km}}}}$$

. In this note, we generalize Marques, Sellers and Trojovský result to prove, in particular, that if p ≡ ±1 (mod 5), then \({\left[ {\begin{array}{*{20}{c}} {{p^{a + 1}}} \\ {{p^a}} \end{array}} \right]_{F,m}} \equiv 1\) (mod p), for all a ≥ 0 and m ≥ 1.

     

An existence principle for solutions to a singular boundary-value problems

The singular boundary-value problem

$ \left\{ {\begin{array}{*{20}{c}} {{u^{\prime\prime}} + g\left( {t,u,{u^{\prime}}} \right) = 0\quad {\text{for}}\quad t \in \left( {0,1} \right),} \hfill \\ {u(0) = u(1) = 0} \hfill \\ \end{array} } \right. $

is studied. The singularity may appear at u?=?0, and the function g may change sign. An existence theorem for solutions to the above boundary-value problem is proposed, and it is proved via the method of upper and lower solutions.

     

Dominant dimensions,derived equivalences and tilting modules

We show that for every ? > 0 there exist δ > 0 and n₀ ∈ ? such that every 3-uniform hypergraph on n ≥ n₀ vertices with the property that every k-vertex subset, where k ≥ δn, induces at least \(\left( {\frac{1}{2} + \varepsilon } \right)\left( {\begin{array}{*{20}c} k \\ 3 \\ \end{array} } \right)\) edges, contains K₄^? as a subgraph, where K₄^? is the 3-uniform hypergraph on 4 vertices with 3 edges. This question was originally raised by Erd?s and Sós. The constant 1/4 is the best possible.     

Proof of the Erdős matching conjecture in a new range

Let s > k ≧ 2 be integers. It is shown that there is a positive real ε = ε(k) such that for all integers n satisfying (s + 1)k ≦ n < (s + 1)(k + ε) every k-graph on n vertices with no more than s pairwise disjoint edges has at most \(\left( {\begin{array}{*{20}{c}} {\left( {s + 1} \right)k - 1} \\ k \end{array}} \right)\) edges in total. This proves part of an old conjecture of Erd?s.     

A continuous model for systems of complexity 2 on simple abelian groups

It is known that if p is a sufficiently large prime, then, for every function f: Z_p → [0, 1], there exists a continuous function f′: T → [0, 1] on the circle such that the averages of f and f′ across any prescribed system of linear forms of complexity 1 differ by at most ∈. This result follows from work of Sisask, building on Fourier-analytic arguments of Croot that answered a question of Green. We generalize this result to systems of complexity at most 2, replacing T with the torus T² equipped with a specific filtration. To this end, we use a notion of modelling for filtered nilmanifolds, that we define in terms of equidistributed maps and combine this notion with tools of quadratic Fourier analysis. Our results yield expressions on the torus for limits of combinatorial quantities involving systems of complexity 2 on Z_p. For instance, let m₄(α, Z_p) denote the minimum, over all sets A ? Z_p of cardinality at least αp, of the density of 4-term arithmetic progressions inside A. We show that limp→∞ m₄(α, Z_p) is equal to the infimum, over all continuous functions f: T₂ →[0, 1] with \({\smallint _{{T^2}}}f \geqslant a\), of the integral

$$\int_{{T^5}} {f\left( {\begin{array}{*{20}{c}}{{x_1}} \\ {{y_1}} \end{array}} \right)} f\left( {\begin{array}{*{20}{c}}{{x_1} + {x_2}} \\ {{y_1} + {y_2}} \end{array}} \right)f\left( {\begin{array}{*{20}{c}}{{x_1} + 2{x_2}} \\ {{y_1} + 2{y_2} + {y_3}} \end{array}} \right).f\left( {\begin{array}{*{20}{c}}{{x_1} + 3{x_2}} \\ {{y_1} + 3{y_2} = 3{y_3}} \end{array}} \right)d{\mu _{{T^5}}}({x_1},{x_2},{y_1},{y_2},{y_3})$$

     

The emission spectrum of IBr excited in the presence of Argon

Wavelengths and wavenumbers of the band heads in the region 3915–3540 Å are recorded as obtained from the measurements of the plates taken on a first order 21-feet grating spectrograph. Earlier workers recently reported 40 bands of this system covering the region 3900–3800 Å. All the bands of this system obtained in the present experiments are analysed as involving the³ Π (1) state for lower state. The constants for the lower state are such that they represent well the ΔG (v+1/2) values obtained in the present experiments fromv=0 tov=26 as well as those obtained by Brown fromv=9 tov=43. The vibrational constants of the two states involved are:

$$\begin{gathered} \begin{array}{*{20}c} {\omega _e ^{\prime \prime } } \\ {137 \cdot 8 cm.^{ - 1} ,} \\ \end{array} \begin{array}{*{20}c} {\omega _e ^{\prime \prime } x_e ^{\prime \prime } } \\ {0 \cdot 571 cm.^{ - 1} } \\ \end{array} \begin{array}{*{20}c} {\omega _e ^{\prime \prime } y_e ^{\prime \prime } } \\ { - 0 \cdot 1156 cm.^{ - 1} } \\ \end{array} \begin{array}{*{20}c} {\omega _e z_e ^{\prime \prime } } \\ {3 \cdot 09 \times 10^{ - 3} cm.^{ - 1} } \\ \end{array} \hfill \\ \begin{array}{*{20}c} {\omega _e ^{\prime \prime } t_e ^{\prime \prime } } \\ { - 2 \cdot 5 \times 10^{ - 5} cm.^{ - 1} ,} \\ \end{array} \begin{array}{*{20}c} {\omega _e ^\prime } \\ {90 \cdot 1 cm.^{ - 1} ,} \\ \end{array} \begin{array}{*{20}c} {\omega _e ^\prime x_e ^\prime } \\ {0 \cdot 15 cm.^{ - 1} } \\ \end{array} \hfill \\ \end{gathered} $$     

Seas of squares with sizes from a Π<Stack><Subscript>1</Subscript><Superscript>0</Superscript></Stack> set

A family of sets is union-free if there are no three distinct sets in the family such that the union of two of the sets is equal to the third set. Kleitman proved that every union-free family has size at most (1+o(1))( _n/2 ⁿ ). Later, Burosch–Demetrovics–Katona–Kleitman–Sapozhenko asked for the number α(n) of such families, and they proved that \({2^{\left( {\begin{array}{*{20}{c}} n \\ {n/2} \end{array}} \right)}} \leqslant \alpha \left( n \right) \leqslant {2^{2\sqrt 2 \left( {\begin{array}{*{20}{c}} n \\ {n/2} \end{array}} \right)\left( {1 + o\left( 1 \right)} \right)}}\) They conjectured that the constant \(2\sqrt 2 \) can be removed in the exponent of the right-hand side. We prove their conjecture by formulating a new container-type theorem for rooted hypergraphs.     

<Emphasis Type="Italic">s</Emphasis>-Vertex Pancyclic Index

A graph G is vertex pancyclic if for each vertex \({v \in V(G)}\) , and for each integer k with 3 ≤ k ≤ |V(G)|, G has a k-cycle C _k such that \({v \in V(C_k)}\) . Let s ≥ 0 be an integer. If the removal of at most s vertices in G results in a vertex pancyclic graph, we say G is an s-vertex pancyclic graph. Let G be a simple connected graph that is not a path, cycle or K _1,3. Let l(G) = max{m : G has a divalent path of length m that is not both of length 2 and in a K ₃}, where a divalent path in G is a path whose interval vertices have degree two in G. The s-vertex pancyclic index of G, written vp _s (G), is the least nonnegative integer m such that L ^m (G) is s-vertex pancyclic. We show that for a given integer s ≥ 0,

$vp_s(G)\le \left\{\begin{array}{l@{\quad}l}\qquad\quad\quad\,\,\,\,\,\,\, l(G)+s+1: \quad {\rm if} \,\, 0 \le s \le 4 \\ l(G)+\lceil {\rm log}_2(s-2) \rceil+4: \quad {\rm if} \,\, s \ge 5 \end{array}\right.$

And we improve the bound for essentially 3-edge-connected graphs. The lower bound and whether the upper bound is sharp are also discussed.

     

Infinitely many sign-changing solutions of an elliptic problem involving critical Sobolev and Hardy–Sobolev exponent

We study the existence and multiplicity of sign-changing solutions of the following equation

$$\begin{array}{@{}rcl@{}} \left\{\begin{array}{lllllllll} -{\Delta} u = \mu |u|^{2^{\star}-2}u+\frac{|u|^{2^{*}(t)-2}u}{|x|^{t}}+a(x)u \quad\text{in}\, {\Omega}, \\ u=0 \quad\text{on}\quad\partial{\Omega}, \end{array}\right. \end{array} $$

where Ω is a bounded domain in \(\mathbb {R}^{N}\), 0∈?Ω, all the principal curvatures of ?Ω at 0 are negative and μ≥0, a>0, N≥7, 0<t<2, \(2^{\star }=\frac {2N}{N-2}\) and \(2^{\star }(t)=\frac {2(N-t)}{N-2}\).

     

A note on some results of Hua in short intervals

In this paper, we improve the previous results of the authors [G. Lü and H. Tang, On some results of Hua in short intervals, Lith. Math. J., 50(1):54–70, 2010] by proving that each sufficiently large integer N satisfying some congruence conditions can be written as

$ \left\{ {\begin{array}{*{20}{c}} {N = p_1^2 + p_2^2 + p_3^2 + p_4^2 + {p^k},} \hfill \\ {\left| {{p_j} - \sqrt {{\frac{N}{5}}} } \right| \leqslant U,\quad \left| {p - {{\left( {\frac{N}{5}} \right)}^{\frac{1}{k}}}} \right| \leqslant U\,{N^{ - \frac{1}{2} + \frac{1}{k}}},\quad j = 1,\,2,\,\,3,\,4,} \hfill \\ \end{array} } \right. $

where U = N ^1/2?η+ε with \( \eta = \frac{1}{{2k\left( {{K^2} + 1} \right)}} \) and K = 2k ^?1, k ? 2.

     

Numerical Radius Inequalities for Certain 2 × 2 Operator Matrices

We prove several numerical radius inequalities for certain 2 × 2 operator matrices. Among other inequalities, it is shown that if X, Y, Z, and W are bounded linear operators on a Hilbert space, then

$$w\left( \left[\begin{array}{cc} X &; Y \\ Z &; W \end{array} \right] \right) \geq \max \left(w(X),w(W),\frac{w(Y+Z)}{2},\frac{w(Y-Z)}{2}\right) $$

and

$$w\left( \left[\begin{array}{cc}X &; Y \\ Z &; W\end{array} \right] \right) \leq \max \left( w(X), w(W)\right)+\frac{w(Y+Z)+w(Y-Z)}{2}. $$

As an application of a special case of the second inequality, it is shown that

$$\frac{\left\Vert X\right\Vert }{2}+\frac{\left\vert \left\Vert\operatorname{Re}{X}\right\Vert -\frac{\left\Vert X\right\Vert}{2}\right\vert }{4}+\frac{ \left\vert \left\Vert \operatorname{Im}{X}\right\Vert -\frac{\left\Vert X\right\Vert}{2}\right\vert }{4} \leq w(X), $$

which is a considerable improvement of the classical inequality \({\frac{ \left\Vert X\right\Vert }{2}\leq w(X)}\) . Here w(·) and || · || are the numerical radius and the usual operator norm, respectively.

     

Some Generic Properties of Non Degeneracy for Critical Points of Functionals and Applications

We give some generic properties of non degeneracy for critical points of functionals. We apply these results, obtaining some theorems of multiplicity of solutions for the equation

$ \left\{\begin{array}{ll} -\varepsilon^2\Delta_g u + u = |u|^{p-2}u \quad {\rm in}\ M \\ \qquad \qquad \qquad \qquad \qquad \qquad \qquad, \\ u \in H_g^1(M) \end{array}\right. $

where M is a compact Riemannian manifold of dimension n and \({2 < p < \frac{2n}{n\,-\,2}}\).

     

Face numbers and the fundamental group

We resolve a conjecture of Kalai asserting that the g ₂-number of any (finite) simplicial complex Δ that represents a normal pseudomanifold of dimension d ≥ 3 is at least as large as \(\left( {\begin{array}{*{20}{c}} {d + 2} \\ 2 \end{array}} \right)m\left( \Delta \right)\), where m(Δ) denotes the minimum number of generators of the fundamental group of Δ. Furthermore, we prove that a weaker bound, \({h_2}\left( \Delta \right) \geqslant \left( {\begin{array}{*{20}{c}} {d + 1} \\ 2 \end{array}} \right)m\left( \Delta \right)\), applies to any d-dimensional pure simplicial poset Δ all of whose faces of co-dimension ≥ 2 have connected links. This generalizes a result of Klee. Finally, for a pure relative simplicial poset Ψ all of whose vertex links satisfy Serre’s condition (S _r ), we establish lower bounds on h ₁(Ψ),...,h _r (Ψ) in terms of the μ-numbers introduced by Bagchi and Datta.     

The Cauchy–Kowalewski Theorem in the Space of Pseudo Q-holomorphic Functions

In this work, we prove the Cauchy–Kowalewski theorem for the initial-value problem

$$\begin{aligned} \frac{\partial w}{\partial t}= & {} Lw \\ w(0,z)= & {} w_{0}(z) \end{aligned}$$

where

$$\begin{aligned} Lw:= & {} E_{0}(t,z)\frac{\partial }{\partial \overline{\phi }}\left( \frac{ d_{E}w}{dz}\right) +F_{0}(t,z)\overline{\left( \frac{\partial }{\partial \overline{\phi }}\left( \frac{d_{E}w}{dz}\right) \right) }+C_{0}(t,z)\frac{ d_{E}w}{dz} \\&+G_{0}(t,z)\overline{\left( \frac{d_{E}w}{dz}\right) } +A_{0}(t,z)w+B_{0}(t,z)\overline{w}+D_{0}(t,z) \end{aligned}$$

in the space \(P_{D}\left( E\right) \) of Pseudo Q-holomorphic functions.