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.     

Criteria for the solubility of finite groups by their centralizers

For any group G, let C(G){\mathcal{C}(G)} denote the set of centralizers of G. We say that a group G has n centralizers (G is a C_n{\mathcal{C}_n}-group) if |C(G)| = n{|\mathcal{C}(G)| = n}. In this note, we show that the derived length of a soluble C_n{\mathcal{C}_n}-group (not necessarily finite) is bounded by a function of n.     

On the Upper Bounds of the Numbers of Perfect Matchings in Graphs with Given Parameters

Let φ(G),κ(G),α(G),χ(G),cl(G),diam(G)denote the number of perfect matchings,connectivity,independence number,chromatic number,clique number and diameter of a graph G,respectively.In this note,by constructing some extremal graphs,the following extremal problems are solved:1.max{φ(G):|V(G)|=2n,κ(G)≤k}=k[(2n-3)!!],2.max{φ(G):|V(G)|=2n,α(G)≥k}=[multiply from i=0 to k-1(2n-k-i)[(2n-2k-1)!!],3.max{φ(G):|V(G)|=2n,χ(G)≤k}=φ(T_(k,2n))T_(k,2n)is the Turán graph,that is a complete k-partite graphon 2n vertices in which all parts are as equal in size as possible,4.max{φ(G):|V(G)|=2n,cl(G)=2}=n1,5.max{φ(G):|V(G)|=2n,diam(G)≥2}=(2n-2)(2n-3)[(2n-5)!!],max{φ(G):|V(G)|=2n,diam(G)≥3}=(n-1)~2[(2n-5)!!].     

An improved construction of progression-free sets

The problem of constructing dense subsets S of {1, 2, ..., n} that contain no three-term arithmetic progression was introduced by Erdős and Turán in 1936. They have presented a construction with |S| = W(n^log₃2)|S| = \Omega ({n^{{{\log }_3}2}}) elements. Their construction was improved by Salem and Spencer, and further improved by Behrend in 1946. The lower bound of Behrend is

On Bernstein–Walsh-type lemmas in regions of the complex plane

Let G ì \mathbb C G \subset {\mathbb C} be a finite region bounded by a Jordan curve L: = ?G L: = \partial G , let W: = \textext[`(G)] \Omega : = {\text{ext}}\bar{G} (with respect to [`(\mathbb C)] {\overline {\mathbb C}} ), $ \Delta : = \left\{ {z:\left| z \right| > 1} \right\} $ \Delta : = \left\{ {z:\left| z \right| > 1} \right\} , and let w = F(z) w = \Phi (z) be a univalent conformal mapping of Ω onto Δ normalized by $ \Phi \left( \infty \right) = \infty, \;\Phi '\left( \infty \right) > 0 $ \Phi \left( \infty \right) = \infty, \;\Phi '\left( \infty \right) > 0 . By A _p (G); p > 0; we denote a class of functions f analytic in G and satisfying the condition

Proof of a conjecture of V. Nikiforov

Using analytical tools, we prove that for any simple graph G on n vertices and its complement [`(G)]\bar G the inequality $\mu \left( G \right) + \mu \left( {\bar G} \right) \leqslant \tfrac{4} {3}n - 1$\mu \left( G \right) + \mu \left( {\bar G} \right) \leqslant \tfrac{4} {3}n - 1 holds, where μ(G) and m( [`(G)] )\mu \left( {\bar G} \right) denote the greatest eigenvalue of adjacency matrix of the graphs G and [`(G)]\bar G respectively.     

Interpolation with lagrange polynomials a simple proof of Markov inequality and some of its generalizations

The following theorem is provedTheorem 1.Let q be a polynomial of degree n(qP_n)with n distinct zeroes lying inthe interval[-1,1] and△'_q={-1}∪{τ_i:q'(τ_i)=0,i=1,n-1}∪{1}.If polynomial pP_n satisfies the inequalitythen for each k=1,n and any x[-1,1]its k-th derivative satisfies the inequality丨p~(k)(x)丨≤max{丨q~((k))(x)丨,丨1/k(x~2-1)q~(k+1)(x)+xq~((k))(x)丨}.This estimate leads to the Markov inequality for the higher order derivatives ofpolynomials if we set q=T_n,where Tn is Chebyshev polynomial least deviated from zero.Some other results are established which gives evidence to the conjecture that under theconditions of Theorem 1 the inequality ‖p~((k))‖≤‖q~(k)‖holds.     

On the maximum modulus principle for polynomials in a quasidisk

LetG⊂C be a quasidisk,K ⊂ G be a compact set, andp _n be a non-constant complex polynomial of degree at mostn. We establish the inequality whereα _n < 0 depends onn, K, and the geometrical structure of ϖG.     

Ordering the non-starlike trees with large reverse wiener indices

The reverse Wiener index of a connected graph G is defined as {

Estimates of the Solutions of Strongly Degenerate Elliptic Equations in Weighted Sobolev Spaces

Let W ì \mathbbRⁿ \Omega \subset \mathbb{R}^n be an open set and l(x) | u |_p,l = ( ò_W l^p (x)| u(x) |^p dx )^1/p \text (1 \leqslant p < + ￥\text),\left| u \right|_{p,l} = \left( {\int\limits_\Omega {l^p (x)\left| {u(x)} \right|^p dx} } \right)^{1/p} {\text{ (1}} \leqslant p < + \infty {\text{),}}     

Maximum Hitting of a Set by Compressed Intersecting Families

For a family A{\mathcal{A}} and a set Z, denote {A ? A \colon A ?Z 1 ?}{\{A \in \mathcal{A} \colon A \cap Z \neq \emptyset\}} by A(Z){\mathcal{A}(Z)}. For positive integers n and r, let S_n,r{\mathcal{S}_{n,r}} be the trivial compressed intersecting family {A ? (c[n]r ) \colon 1 ? A}{\{A \in \big(\begin{subarray}{c}[n]\\r \end{subarray}\big) \colon 1 \in A\}}, where [n] : = {1, ?, n}{[n] := \{1, \ldots, n\}} and (c[n]r ) : = {A ì [n] \colon |A| = r}{\big(\begin{subarray}{c}[n]\\r \end{subarray}\big) := \{A \subset [n] \colon |A| = r\}}. The following problem is considered: For r ≤ n/2, which sets Z í [n]{Z \subseteq [n]} have the property that |A(Z)| ￡ |S_n,r(Z)|{|\mathcal{A}(Z)| \leq |\mathcal{S}_{n,r}(Z)|} for any compressed intersecting family A ì (c[n]r ){\mathcal{A}\subset \big(\begin{subarray}{c}[n]\\r \end{subarray}\big)}? (The answer for the case 1 ? Z{1 \in Z} is given by the Erdős–Ko–Rado Theorem.) We give a complete answer for the case |Z| ≥ r and a partial answer for the much harder case |Z| < r. This paper is motivated by the observation that certain interesting results in extremal set theory can be proved by answering the question above for particular sets Z. Using our result for the special case when Z is the r-segment {2, ?, r+1}{\{2, \ldots, r+1\}}, we obtain new short proofs of two well-known Hilton–Milner theorems. At the other extreme end, by establishing that |A(Z)| ￡ |S_n,r(Z)|{|\mathcal{A}(Z)| \leq |\mathcal{S}_{n,r}(Z)|} when Z is a final segment, we provide a new short proof of a Holroyd–Talbot extension of the Erdős-Ko-Rado Theorem.     

On 2-factors with given properties in claw-free graphs

Let G be a claw-free graph such that (i) k(G) 3 2k(G) \geq 2, (ii) $|V (G)| \geq 8$|V (G)| \geq 8 and (iii) d(G) 3 4\delta(G) \geq 4. For every pair of edges e₁, e₂ of G the graph G^* = G - {e₁, e₂}G^* = G - \{e_1, e_2\} has a 2-factor.     

Abelian coverings of finite general linear groups and an application to their non-commuting graphs

In this paper we introduce and study a family A_n(q)\mathcal{A}_{n}(q) of abelian subgroups of GL_n(q){\rm GL}_{n}(q) covering every element of GL_n(q){\rm GL}_{n}(q). We show that A_n(q)\mathcal{A}_{n}(q) contains all the centralizers of cyclic matrices and equality holds if q>n. For q>2, we obtain an infinite product expression for a probabilistic generating function for |A_n(q)||\mathcal{A}_{n}(q)|. This leads to upper and lower bounds which show in particular that

Dimension Free Estimates for Riesz Transforms Associated to the Harmonic Oscillator on \mathbb{R}^{n}

Let L=?Δ+|ξ|² be the harmonic oscillator on $\mathbb{R}^{n}Let L=−Δ+|ξ|² be the harmonic oscillator on \mathbbRⁿ\mathbb{R}^{n} , with the associated Riesz transforms R_2j−1=(∂/∂ξ_j)L^−1/2,R_2j=ξ_jL^−1/2. We give a shorter proof of a recent result of Harboure, de Rosa, Segovia, Torrea: For 1<p<∞ and a dimension free constant C_p,

||(?k=12n|Rk(f)|2)1/2||Lp(\mathbbRn,dx)\leqslant Cp||f||Lp(\mathbbRn,dx).\bigg\Vert \bigg(\sum_{k=1}^{2n}\vert R_{k}(f)\vert ^{2}\bigg)^{{1}/{2}}\bigg\Vert _{L^{p}(\mathbb{R}^{n},\mathrm{d}\xi )}\leqslant C_{p}\Vert f\Vert _{L^{p}(\mathbb{R}^{n},\mathrm{d}\xi )}.      15. Integral inequalities for self-reciprocal polynomials      Horst Alzer 《Proceedings Mathematical Sciences》2010,120(2):131-137 Let n ≥ 1 be an integer and let P n be the class of polynomials P of degree at most n satisfying z n P(1/z) = P(z) for all z ∈ C. Moreover, let r be an integer with 1 ≤ r ≤ n. Then we have for all P ∈ P n : $ \alpha _n (r)\int_0^{2\pi } {|P(e^{it} )|^2 dt} \leqslant \int_0^{2\pi } {|P^r (e^{it} )|^2 dt} \leqslant \beta _n (r)\int_0^{2\pi } {|P(e^{it} )|^2 dt} $ \alpha _n (r)\int_0^{2\pi } {|P(e^{it} )|^2 dt} \leqslant \int_0^{2\pi } {|P^r (e^{it} )|^2 dt} \leqslant \beta _n (r)\int_0^{2\pi } {|P(e^{it} )|^2 dt}       16. An upper bound on the Chebotarev invariant of a finite group      Andrea Lucchini  Gareth Tracey 《Israel Journal of Mathematics》2017,219(1):449-467 A subset {g 1,..., g d } of a finite group G invariably generates \(\left\{ {g_1^{{x_1}}, \ldots ,g_d^{{x_d}}} \right\}\) generates G for every choice of x i ∈ G. The Chebotarev invariant C(G) of G is the expected value of the random variable n that is minimal subject to the requirement that n randomly chosen elements of G invariably generate G. The first author recently showed that \(C\left( G \right) \leqslant \beta \sqrt {\left| G \right|} \) for some absolute constant β. In this paper we show that, when G is soluble, then β is at most 5/3. We also show that this is best possible. Furthermore, we show that, in general, for each ε > 0 there exists a constant c ε such that \(C\left( G \right) \leqslant \left( {1 + \in } \right)\sqrt {\left| G \right|} + {c_ \in }\).      17. The noncommutative Choquet boundary II: Hyperrigidity      William Arveson 《Israel Journal of Mathematics》2011,184(1):349-385 A (finite or countably infinite) set G of generators of an abstract C*-algebra A is called hyperrigid if for every faithful representation of A on a Hilbert space A ⊆ B(H) and every sequence of unital completely positive linear maps ϕ 1, ϕ 2,... from B(H) to itself, limn ? ￥ ||fn(g) - g|| = 0,"g ? G T limn ? ￥ fn(a) - a|| = 0,"a ? A.\mathop {\lim }\limits_{n \to \infty } ||{\phi _n}(g) - g|| = 0,{\forall _g} \in G \Rightarrow \mathop {\lim }\limits_{n \to \infty } {\phi _n}(a) - a|| = 0,{\forall _a} \in A.      18. Singular oscillatory integrals on {\mathbb{R}^n}      M. Papadimitrakis  I. R. Parissis 《Mathematische Zeitschrift》2010,266(1):169-179 Let ${\mathcal{P}_{d,n}}Let Pd,n{\mathcal{P}_{d,n}} denote the space of all real polynomials of degree at most d on \mathbbRn{\mathbb{R}^n} . We prove a new estimate for the logarithmic measure of the sublevel set of a polynomial P ? Pd,1{P\in \mathcal{P}_{d,1}} . Using this estimate, we prove that supP ? Pd,n| p.v.ò\mathbbRneiP(x)\fracW(x/|x|)|x|ndx| ￡ c log d (||W||L logL(Sn-1)+1),\mathop{\rm sup}\limits_ {P \in \mathcal{P}_{d,n}}\left| p.v.\int_{\mathbb{R}^{n}}{e^{iP(x)}}{\frac{\Omega(x/|x|)}{|x|^n}dx}\right | \leq c\,{\rm log}\,d\,(||\Omega||_L \log L(S^{n-1})+1),      19. Projective Freeness of Algebras of Real Symmetric Functions      Amol Sasane 《Complex Analysis and Operator Theory》2012,6(2):465-475 Let \mathbb Dn:={z=(z1,?, zn) ? \mathbb Cn:|zj| < 1,   j=1,?, n}{\mathbb {D}^n:=\{z=(z_1,\ldots, z_n)\in \mathbb {C}^n:|z_j| < 1, \;j=1,\ldots, n\}}, and let [`(\mathbbD)]n{\overline{\mathbb{D}}^n} denote its closure in \mathbb Cn{\mathbb {C}^n}. Consider the ring Cr([`(\mathbbD)]n;\mathbb C) = {f:[`(\mathbbD)]n? \mathbb C:f   is   continuous   and  f(z)=[`(f([`(z)]))]   (z ? [`(\mathbbD)]n)}C_{\rm r}(\overline{\mathbb{D}}^n;\mathbb {C}) =\left\{f: \overline{\mathbb{D}}^n\rightarrow \mathbb {C}:f \,\, {\rm is \,\, continuous \,\, and}\,\, f(z)=\overline{f(\overline{z})} \;(z\in \overline{\mathbb{D}}^n)\right\}      20. Bounds for the cubic Weyl sum      D. R. Heath-Brown 《Journal of Mathematical Sciences》2010,171(6):813-823 Subject to the abc-conjecture, we improve the standard Weyl estimate for cubic exponential sums in which the argument is a quadratic irrational. Specifically. we show that ?n \leqslant N e( an3 ) << e, aN\tfrac57 + e \sum\limits_{n \leqslant N} {e\left( {\alpha {n^3}} \right){ \ll_{\varepsilon, \alpha }}{N^{\tfrac{5}{7} + \varepsilon }}}      设为首页 | 免责声明 | 关于勤云 | 加入收藏 Copyright©北京勤云科技发展有限公司  京ICP备09084417号

Integral inequalities for self-reciprocal polynomials

Let n ≥ 1 be an integer and let P _n be the class of polynomials P of degree at most n satisfying z ⁿ P(1/z) = P(z) for all z ∈ C. Moreover, let r be an integer with 1 ≤ r ≤ n. Then we have for all P ∈ P _n :

An upper bound on the Chebotarev invariant of a finite group

A subset {g ₁,..., g _d } of a finite group G invariably generates \(\left\{ {g_1^{{x_1}}, \ldots ,g_d^{{x_d}}} \right\}\) generates G for every choice of x _i ∈ G. The Chebotarev invariant C(G) of G is the expected value of the random variable n that is minimal subject to the requirement that n randomly chosen elements of G invariably generate G. The first author recently showed that \(C\left( G \right) \leqslant \beta \sqrt {\left| G \right|} \) for some absolute constant β. In this paper we show that, when G is soluble, then β is at most 5/3. We also show that this is best possible. Furthermore, we show that, in general, for each ε > 0 there exists a constant c _ε such that \(C\left( G \right) \leqslant \left( {1 + \in } \right)\sqrt {\left| G \right|} + {c_ \in }\).     

The noncommutative Choquet boundary II: Hyperrigidity

A (finite or countably infinite) set G of generators of an abstract C*-algebra A is called hyperrigid if for every faithful representation of A on a Hilbert space A ⊆ B(H) and every sequence of unital completely positive linear maps ϕ ₁, ϕ ₂,... from B(H) to itself,

Singular oscillatory integrals on {\mathbb{R}^n}

Let ${\mathcal{P}_{d,n}}Let P_d,n{\mathcal{P}_{d,n}} denote the space of all real polynomials of degree at most d on \mathbbRⁿ{\mathbb{R}^n} . We prove a new estimate for the logarithmic measure of the sublevel set of a polynomial P ? P_d,1{P\in \mathcal{P}_{d,1}} . Using this estimate, we prove that

supP ? Pd,n| p.v.ò\mathbbRneiP(x)\fracW(x/|x|)|x|ndx| ￡ c log d (||W||L logL(Sn-1)+1),\mathop{\rm sup}\limits_ {P \in \mathcal{P}_{d,n}}\left| p.v.\int_{\mathbb{R}^{n}}{e^{iP(x)}}{\frac{\Omega(x/|x|)}{|x|^n}dx}\right | \leq c\,{\rm log}\,d\,(||\Omega||_L \log L(S^{n-1})+1),      19. Projective Freeness of Algebras of Real Symmetric Functions      Amol Sasane 《Complex Analysis and Operator Theory》2012,6(2):465-475 Let \mathbb Dn:={z=(z1,?, zn) ? \mathbb Cn:|zj| < 1,   j=1,?, n}{\mathbb {D}^n:=\{z=(z_1,\ldots, z_n)\in \mathbb {C}^n:|z_j| < 1, \;j=1,\ldots, n\}}, and let [`(\mathbbD)]n{\overline{\mathbb{D}}^n} denote its closure in \mathbb Cn{\mathbb {C}^n}. Consider the ring Cr([`(\mathbbD)]n;\mathbb C) = {f:[`(\mathbbD)]n? \mathbb C:f   is   continuous   and  f(z)=[`(f([`(z)]))]   (z ? [`(\mathbbD)]n)}C_{\rm r}(\overline{\mathbb{D}}^n;\mathbb {C}) =\left\{f: \overline{\mathbb{D}}^n\rightarrow \mathbb {C}:f \,\, {\rm is \,\, continuous \,\, and}\,\, f(z)=\overline{f(\overline{z})} \;(z\in \overline{\mathbb{D}}^n)\right\}      20. Bounds for the cubic Weyl sum      D. R. Heath-Brown 《Journal of Mathematical Sciences》2010,171(6):813-823 Subject to the abc-conjecture, we improve the standard Weyl estimate for cubic exponential sums in which the argument is a quadratic irrational. Specifically. we show that ?n \leqslant N e( an3 ) << e, aN\tfrac57 + e \sum\limits_{n \leqslant N} {e\left( {\alpha {n^3}} \right){ \ll_{\varepsilon, \alpha }}{N^{\tfrac{5}{7} + \varepsilon }}}      设为首页 | 免责声明 | 关于勤云 | 加入收藏 Copyright©北京勤云科技发展有限公司  京ICP备09084417号

Projective Freeness of Algebras of Real Symmetric Functions

Let \mathbb Dⁿ:={z=(z₁,?, z_n) ? \mathbb Cⁿ:|z_j| < 1,   j=1,?, n}{\mathbb {D}^n:=\{z=(z_1,\ldots, z_n)\in \mathbb {C}^n:|z_j| < 1, \;j=1,\ldots, n\}}, and let [`(\mathbbD)]ⁿ{\overline{\mathbb{D}}^n} denote its closure in \mathbb Cⁿ{\mathbb {C}^n}. Consider the ring

Bounds for the cubic Weyl sum

Subject to the abc-conjecture, we improve the standard Weyl estimate for cubic exponential sums in which the argument is a quadratic irrational. Specifically. we show that