Upper bounds on vertex distinguishing chromatic index of some Halin graphs

A vertex distinguishing edge coloring of a graph G is a proper edge coloring of G such that any pair of vertices has the distinct sets of colors. The minimum number of colors required for a vertex distinguishing edge coloring of a graph C is denoted by Xs＇8（G）. In this paper, we obtained upper bounds on the vertex distinguishing chromatic index of 3-regular Halin graphs and Halin graphs with △（G） ≥ 4, respectively.

On the upper bounds of (1,0)-super solutions for the regular balanced random (k,2s)-SAT problem

This paper explores the conditions which make a regular balancedrandom(k,2s)-CNFformula(1,O)-unsatisfiable with high probability.The conditions also make a random instance of the regular balanced(k-1,2(k-1)s)-SAT problem unsatisfiable with high probability,where the instance obeys a distribution which differs from the distribution obeyed by a regular balanced random(k-1,2(k-1)s)-CNF formula.Let F be a regular balanced random(k,2s)-CNF formula where k≥3,then there exists a number so such that F is(1,O)-unsatisfiable with high probability if s>so.A numerical solution of the number so when k e(5,6,...,14)is given to conduct simulated experiments.The simulated experiments verify the theoretical result.Besides,the experiments also suggest that F is(1,O)-satisfiable with high probability if s is less than a certain value.

Lower and upper bounds of Dirichlet eigenvalues for totally characteristic degenerate elliptic operators

Let λkbe the k-th Dirichlet eigenvalue of totally characteristic degenerate elliptic operator-ΔB defined on a stretched cone B0 ■ [0,1) × X with boundary on {x1 = 0}. More precisely,ΔB=(x1αx1)2+ α2x2+ + α2xnis also called the cone Laplacian. In this paper,by using Mellin-Fourier transform,we prove thatλk Cnk2 n for any k 1,where Cn=(nn+2)(2π)2(|B0|Bn)-2n,which gives the lower bounds of the Dirchlet eigenvalues of-ΔB. On the other hand,by using the Rayleigh-Ritz inequality,we deduce the upper bounds ofλk,i.e.,λk+1 1 +4n k2/nλ1. Combining the lower and upper bounds of λk,we can easily obtain the lower bound for the first Dirichlet eigenvalue λ1 Cn(1 +4n)-12n2.

Some Upper Bounds Related with Domination Number

For a simple and connected graph G,denote the domination number,the diameter,and the radius of G asβ(G),D(G),and r(G),respectively.In this paper,we solve two conjectures on the upper bounds ofβ(G)·D(G)andβ(G)+r(G),which are proposed by the computer system AutoGraphiX.Extremal trees which attain the upper bounds are also considered.

PREDICTOR-CORRECTOR ALGORITHM FOR CONVEX QUADRATIC PROGRAMMING WITH UPPER BOUNDS

Predictor-corrector algorithm for linear programming, proposed by Mizuno et al.([1]), becomes the best well known in the interior point methods. The purpose of this paper is to extend these results in two directions. First, we modify the algorithm in order to solve convex quadratic programming with upper bounds. Second, we replace the corrector step with an iteration of Monteiro and Adler's algorithm([2]). With these modifications, the duality gap is reduced by a constant factor after each corrector step for convex quadratic programming. It is shown that the new algorithm has a O(root nL)-iteration complexity.

ON UPPER BOUNDS OF BANDWIDTHS OF TREES

B(G) denotes the bandwidth of graph G. For tree T, Ve(T)={v|v∈V(T) and dT(v)=1}. In this paper, we discuss bandwidths of trees and obtain that for any tree T,B(T)and the bounds is sharp. For two extreme cases, a tree with a minimal number of internal vertices or one with a maximal number of internal vertices, that is, a star or a path, the equality holds.This bounds is much better than the previous one, B(G) .

Computing the lower and upper bounds of Laplace eigenvalue problem:by combining conforming and nonconforming finite element methods

We introduce some ways to compute the lower and upper bounds of the Laplace eigenvalue problem.By using the special nonconforming finite elements,i.e.,enriched Crouzeix-Raviart element and extended Q1ro t,we get the lower bound of the eigenvalue.Additionally,we use conforming finite elements to do the postprocessing to get the upper bound of the eigenvalue,which only needs to solve the corresponding source problems and a small eigenvalue problem if higher order postprocessing method is implemented.Thus,we can obtain the lower and upper bounds of the eigenvalues simultaneously by solving eigenvalue problem only once.Some numerical results are also presented to demonstrate our theoretical analysis.

Upper Bounds for the Laplacian Graph Eigenvalues

We first apply non-negative matrix theory to the matrix K=D+A,where D and A are the degree-diagonal and adjacency matrices of a graph G,respectively,to establish a relation on the largest Laplacian eigenvalue λ_1(G)of G and the spectral radius ρ(K)of K.And then by using this relation we present two upper bounds for λ_1(G)and determine the extremal graphs which achieve the upper bounds.

The Upper Bounds of Arbitrary Eigenvalues for Uniformly Elliptic Operators with Higher Orders

Let Ωbelong to R^m （m≥ 2） be a bounded domain with piecewise smooth and Lipschitz boundary δΩ Let t and r be two nonnegative integers with t ≥ r ＋ 1. In this paper, we consider the variable-coefficient eigenvalue problems with uniformly elliptic differential operators on the left-hand side and （-Δ）^T on the right-hand side. Some upper bounds of the arbitrary eigenvalue are obtained, and several known results are generalized.

Upper bounds of Schubert polynomials

Let w be a permutation of{1,2,...,n},and let D(w)be the Rothe diagram of w.The Schubert polynomial■w_(x)can be realized as the dual character of the flagged Weyl module associated with D(w).This implies the following coefficient-wise inequality:Min_(x)≤■_(w)(x)≤Max_(w)xwhere both Min_(w)(x)and Max_(w)(x)are polynomials determined by D(w).Fink et al.(2018)found that■w_(x)equals the lower bound Min_(w)(x)if and only if w avoids twelve permutation patterns.In this paper,we show that■w_(x)reaches the upper bound Max_(w)(x)if and only if w avoids two permutation patterns 1432 and 1423.Similarly,for any given compositionα∈Z^(n)≥0,one can define a lower bound Min_(α)(x)and an upper bound Max_(α)(x)for the key polynomialκ_(α)(x).Hodges and Yong(2020)established thatκ_(α)(x)equals Min_(α)(x)if and only ifαavoids five composition patterns.We show thatκ_(α)(x)equals Max_(α)(x)if and only ifαavoids a single composition pattern(0,2).As an application,we obtain that whenαavoids(0,2),the key polynomialκ_(α)(x)is Lorentzian,partially verifying a conjecture of Huh et al.(2019).

Upper bounds for eigenvalues of Cauchy-Hankel tensors

We present upper bounds of eigenvalues for finite and infinite dimensional Cauchy-Hankel tensors.It is proved that an m-order infinite dimensional Canchy-Hankel tensor defines a bounded and positively(m-1)-homogeneous operator from l^(1)into l^(p)(1<p<∞),and two upper bounds of corresponding positively homogeneous operator norms are given.Moreover,for a fourth-order real partially symmetric Cauchy-Hankel tensor,sufficient and necessary conditions of M-positive definiteness are obtained,and an upper bound of M-eigenvalue is also shown.

非正则赋权有向图A_(α)谱半径的上界

Let D be a weighted digraph with n vertices in which each arc has been assigned a positive number.Let A(D)be the adjacency matrix of D and W(D)=diag(w_(1)^(+),w_(2)^(+),...,w_(n)^(+)).In this paper,we study the matrix A_(α)(D),which is defined as Aα(D)=αW(D)+(1−α)A(D),0≤α≤1.The spectral radius of A_(α)(D)is called the Aαspectral radius of D,denoted byλα(D).We obtain some upper bounds on the Aαspectral radius of strongly connected irregular weighted digraphs.

Link Budget and Enhanced Communication Distance for Ambient Internet of Things

Backscatter communications will play an important role in connecting everything for beyond 5G(B5G)and 6G systems.One open challenge for backscatter communications is that the signals suffer a round-trip path loss so that the communication distance is short.In this paper,we first calculate the communication distance upper bounds for both uplink and downlink by measuring the tag sensitivity and reflection coefficient.It is found that the activation voltage of the envelope detection diode of the downlink tag is the main factor limiting the back-scatter communication distance.Based on this analysis,we then propose to implement a low-noise amplifier(LNA)module before the envelope detection at the tag to enhance the incident signal strength.Our experimental results on the hardware platform show that our method can increase the downlink communication range by nearly 20 m.

MAXIMAL FUNCTION CHARACTERIZATIONS OF HARDY SPACES ASSOCIATED WITH BOTH NON-NEGATIVE SELF-ADJOINT OPERATORS SATISFYING GAUSSIAN ESTIMATES AND BALL QUASI-BANACH FUNCTION SPACES

Assume that L is a non-negative self-adjoint operator on L^(2)(ℝ^(n))with its heat kernels satisfying the so-called Gaussian upper bound estimate and that X is a ball quasi-Banach function space onℝ^(n) satisfying some mild assumptions.Let HX,L(ℝ^(n))be the Hardy space associated with both X and L,which is defined by the Lusin area function related to the semigroup generated by L.In this article,the authors establish various maximal function characterizations of the Hardy space HX,L(ℝ^(n))and then apply these characterizations to obtain the solvability of the related Cauchy problem.These results have a wide range of generality and,in particular,the specific spaces X to which these results can be applied include the weighted space,the variable space,the mixed-norm space,the Orlicz space,the Orlicz-slice space,and the Morrey space.Moreover,the obtained maximal function characterizations of the mixed-norm Hardy space,the Orlicz-slice Hardy space,and the Morrey-Hardy space associated with L are completely new.

Upper Bound of Scalars in the Integer Sub-decomposition Method： The Theoretical Aspects

The focal point of this paper is to present the theoretical aspects of the building blocks of the upper bounds of ISD （integer sub-decomposition） method defined by kP = k11P ＋ k12ψ1 （P） ＋ k21P ＋ k22ψ2 （P） with max {｜k11｜, ｜k12｜} 〈 Ca√n and max{｜k21｜, ｜k22｜}≤C√, where C=I that uses efficiently computable endomorphisms ψj for j=1,2 to compute any multiple kP of a point P of order n lying on an elliptic curve E. The upper bounds of sub-scalars in ISD method are presented and utilized to enhance the rate of successful computation of scalar multiplication kP. Important theorems that establish the upper bounds of the kernel vectors of the ISD reduction map are generalized and proved in this work. The values of C in the upper bounds, that are greater than 1, have been proven in two cases of characteristic polynomials （with degree 1 or 2） of the endomorphisms. The upper bound of ISD method with the case of the endomorphism rings over an integer ring Z results in a higher rate of successful computations kP. Compared to the case of endomorphism rings, which is embedded over an imaginary quadratic field Q = [4-D]. The determination of the upper bounds is considered as a key point in developing the ISD elliptic scalar multiplication technique.

Upper bound solution for supporting pressure acting on shallow tunnel based on modified tangential technique

Based on the nonlinear failure criterion and the upper bound theorem, the modified tangential technique method was proposed to derive the expression of supporting pressure acting on shallow tunnel. Instead of the same stress state, different normal stresses on element boundaries were used. In order to investigate the influence of different factors on supporting pressures, the failure mechanism was established. The solution of supporting pressure, with different parameters, was obtained by optimization theory. The corresponding failure mechanism and numerical results were presented. In comparison with the results using the single tangential technique method, it is found that the proposed method is effective, and the good agreement shows that the present solution of supporting pressure is reliable.

Pseudo-static analysis of cantilever retaining walls using upper bound limit analysis approach

Given the extensive utilization of cantilever retaining walls in construction and development projects,their optimal design and analysis with proper attention to seismic loads is a typical engineering problem.This research presents a new algorithm for pseudo-static analysis of retaining walls employing upper bound method.The algorithm can be utilized to design and check the external and internal stability of the wall based on the proposed mechanism.One of the main features of this algorithm is its ability to determine the critical condition of failure wedges,the minimum safety factor and maximum force acting on the wall,as well as the minimum weight of the wall,simultaneously,by effectively using the multi-objective optimization.The results obtained by the proposed failure mechanisms show that,while using the upper bound limit analysis approach,the active force should be maximized concurrent with optimizing the direction of the plane passing through the back of the heel.The present study also applies the proposed algorithm to determine the critical direction of the earthquake acceleration coefficient.The critical direction of earthquake acceleration coefficient is defined as the direction that maximizes the active force exerted on the wall and minimizes the safety factor for wall stability.The results obtained in this study are in good agreement with those of similar studies carried out based on the limit equilibrium method and finite element analysis.The critical failure mechanisms were determined via optimization with genetic algorithm.

Upper bound solutions of stability factor of shallow tunnels in saturated soil based on strength reduction technique

Based on the upper bound theorem of limit analysis,the factor of safety for shallow tunnel in saturated soil is calculated in conjunction with the strength reduction technique.To analyze the influence of the pore pressure on the factor of safety for shallow tunnel,the power of pore pressure is regarded as a power of external force in the energy calculation.Using the rigid multiple-block failure mechanism,the objective function for the factor of safety is constructed and the optimal solutions are derived by employing the sequential quadratic programming.According to the results of optimization calculation,the factor of safety of shallow tunnel for different pore pressure coefficients and variational groundwater tables are obtained.The parameter analysis shows that the pore pressure coefficient and the location of the groundwater table have significant influence on the factor of safety for shallow tunnel.

Upper bound analytical solution for surrounding rock pressure of shallow unsymmetrical loading tunnels

By combining the results of laboratory model tests with relevant flow rules, the failure mode of shallow unsymmetrical loading tunnels and the corresponding velocity field were established. According to the principle of virtual power, the upper bound solution for surrounding rock pressure of shallow unsymmetrical loading tunnel was derived and verified by an example. The results indicate that the calculated results of the derived upper bound method for surrounding rock pressure of shallow unsymmetrical loading tunnels are relatively close to those of the existing "code method" and test results, which means that the proposed method is feasible. The current code method underestimates the unsymmetrical loading feature of surrounding rock pressure of shallow unsymmetrical loading tunnels, so it is unsafe; when the burial depth is less or greater than two times of the tunnel span and the unsymmetrical loading angle is less than 45°, the upper bound method or the average value of the results calculated by the upper bound method and code method respectively, is comparatively reasonable. When the burial depth is greater than two times of the tunnel span and the unsymmetrical loading angle is greater than 45°, the code method is more suitable.

Upper bound analysis of ultimate pullout capacity of shallow 3-D circular plate anchors based on nonlinear Mohr-Coulomb failure criterion

Based on the nonlinear Mohr-Coulomb failure criterion and the associated flow rules,the three-dimensional(3-D)axisymmetric failure mechanism of shallow horizontal circular plate anchors that are subjected to the ultimate pullout capacity(UPC)is determined.A derivative function of the projection function for projecting the 3-D axisymmetric failure surface on plane is deduced using the variation theory.By using difference principle,the primitive function of failure surface satisfying boundary condition and numerical solution to its corresponding ultimate pullout capacity function are obtained.The influences of nonlinear Mohr-Coulomb parameters on UPC and failure mechanism are studied.The result shows that UPC decreases with dimensionless parameter m and uniaxial tensile strength increases but increases when depth and radius of plate anchor,surface overload,initial cohesion,geomaterial density and friction angle increase.The failure surface is similar to a symmetrical spatial funnel,and its shape is mainly determined by dimensionless parameter m;the surface damage range expands with the increase of radius and depth of the plate anchor as well as initial cohesion but decreases with the increase of dimensionless parameter m and uniaxial tensile strength as well as geomaterial density.As the dimensionless parameter m=2.0,the numerical solution of UPC based on the difference principle is proved to be feasible and effective through the comparison with the exact solution.In addition,the comparison between solutions of UPC computed by variation method and those computed by upper bound method indicate that variation method outperforms upper bound method.