Sum choice number of generalized θ-graphs

Let $G=\left(VE\right)$ be a simple graph and for every vertex $v\in V$ let $L\left(v\right)$ be a set (list) of available colors. $G$ is called $L$-colorable if there is a proper coloring $\phi$ of the vertices with $\phi \left(v\right)\in L\left(v\right)$ for all $v\in V$. A function $f:V\to \mathbb{N}$ is called a choice function of $G$ and $G$ is said to be $f$-list colorable if $G$ is $L$-colorable for every list assignment $L$ choice function is defined by $size\left(f\right)={\sum }_{v\in V}f\left(v\right)$ and the sum choice number ${\chi }_{sc}\left(G\right)$ denotes the minimum size of a choice function of $G$.Sum list colorings were introduced by Isaak in 2002 and got a lot of attention since then.For $r\ge 3$ a generalized ${\theta }_{k_1{k}_2\dots k_r}$-graph is a simple graph consisting of two vertices $v_1$ and $v_2$ connected by $r$ internally vertex disjoint paths of lengths $k_1,k_2,\dots ,k_r$ $(k_1\le k_2\le ?\le k_r)$.In 2014, Carraher et al. determined the sum-paintability of all generalized $\theta$-graphs which is an online-version of the sum choice number and consequently an upper bound for it.In this paper we obtain sharp upper bounds for the sum choice number of all generalized $\theta$-graphs with $k_1\ge 2$ and characterize all generalized $\theta$-graphs $G$ which attain the trivial upper bound $\left|V\left(G\right)\right|+\left|E\left(G\right)\right|$.     

Approximating the independence number via theϑ-function

We describe an approximation algorithm for the independence number of a graph. If a graph onn vertices has an independence numbern/k + m for some fixed integerk 3 and somem > 0, the algorithm finds, in random polynomial time, an independent set of size , improving the best known previous algorithm of Boppana and Halldorsson that finds an independent set of size (m ^1/(k–1)) in such a graph. The algorithm is based on semi-definite programming, some properties of the Lovász-function of a graph and the recent algorithm of Karger, Motwani and Sudan for approximating the chromatic number of a graph. If the-function of ann vertex graph is at leastMn ^1–2/k for some absolute constantM, we describe another, related, efficient algorithm that finds an independent set of sizek. Several examples show the limitations of the approach and the analysis together with some related arguments supply new results on the problem of estimating the largest possible ratio between the-function and the independence number of a graph onn vertices. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.Research supported in part by a USA—Israel BSF grant and by the Fund for Basic Research administered by the Israel Academy of Sciences and by the Minkowski Minerva Center for Geometry at Tel Aviv University.This work was partly done while the author was at XEROX PARC and partly at DIMACS.     

Stevinus’ epitaph: Thermodynamics meets number theory

It is convenient to define (x/a) = cose u and (y/b) = sine u, where u denotes the angle. This approach exploits the similarity between elliptic trigonometry and plane trigonometric functions. Next, the applications of elliptic trigonometry to Laplace transformation and elementary calculus are given.     

Dougall–Dixon formula and harmonic number identities

The Dougall–Dixon summation formula is reformulated in terms of binomial sums. By computing their second derivatives, we establish several harmonic number identities.      

Bounds on the clique-transversal number of regular graphs

A clique-transversal set D of a graph G is a set of vertices of G such that D meets all cliques of G.The clique-transversal number,denoted Tc(G),is the minimum cardinality of a clique- transversal set in G.In this paper we present the bounds on the clique-transversal number for regular graphs and characterize the extremal graphs achieving the lower bound.Also,we give the sharp bounds on the clique-transversal number for claw-free cubic graphs and we characterize the extremal graphs achieving the lower bound.     

The minimal measurement number for generalized conjugate phase retrieval

The generalized conjugate phase retrieval problem aims to reconstruct a complex signal x ∈ Cⁿ from quadratic measurements x*A₁x,...,x*A_mx,where A₁,...,A_m∈R^n×n are real symmetric matrices.The equivalent formulation for generalized conjugate phase retrieval along with the minimal measurement number required for accurate retrieval(up to a global phase factor as well as conjugacy) is derived in this paper.We present a set of nine vectors in R⁴ and prove that it is conjugate phase retrievable on C⁴.This result implies the measurement number bound 4n-6 is not optimal for some n,which confirms a conjecture in the article by Evans and Lai(2019).     

Estimation of the Bezout number for piecewise algebraic curve

A piecewise algebraic curve is a curve determined by the zero set of a bivariate spline function.In this paper.a coniecture on trianguation is confirmed The relation between the piecewise linear algebraiccurve and four-color conjecture is also presented.By Morgan-Scott triangulation, we will show the instabilityof Bezout number of piecewise algebraic curves. By using the combinatorial optimization method,an upper     

Chromatic Gallai identities operating on Lovász number

If $G$ is a triangle-free graph, then two Gallai identities can be written as $\alpha (G)+\overline{\chi }(L(G))=|V(G)|=\alpha (L(G))+\overline{\chi }(G)$ , where $\alpha $ and $\overline{\chi }$ denote the stability number and the clique-partition number, and $L(G)$ is the line graph of  $G$ . We show that, surprisingly, both equalities can be preserved for any graph $G$ by deleting the edges of the line graph corresponding to simplicial pairs of adjacent arcs, according to any acyclic orientation of  $G$ . As a consequence, one obtains an operator $\Phi $ which associates to any graph parameter $\beta $ such that $\alpha (G) \le \beta (G) \le \overline{\chi }(G)$ for all graph $G$ , a graph parameter $\Phi _\beta $ such that $\alpha (G) \le \Phi _\beta (G) \le \overline{\chi }(G)$ for all graph $G$ . We prove that $\vartheta (G) \le \Phi _\vartheta (G)$ and that $\Phi _{\overline{\chi }_f}(G)\le \overline{\chi }_f(G)$ for all graph  $G$ , where $\vartheta $ is Lovász theta function and $\overline{\chi }_f$ is the fractional clique-partition number. Moreover, $\overline{\chi }_f(G) \le \Phi _\vartheta (G)$ for triangle-free $G$ . Comparing to the previous strengthenings $\Psi _\vartheta $ and $\vartheta ^{+ \triangle }$ of $\vartheta $ , numerical experiments show that $\Phi _\vartheta $ is a significant better lower bound for $\overline{\chi }$ than $\vartheta $ .     

Harmonic number identities via the Newton–Andrews method

By means of the Bell polynomials, we establish explicit expressions of the higher-order derivatives of the binomial coefficient \(\binom{x+n}{m}\) and its reciprocal \(\binom{x+n}{m}^{-1}\) , and extend the application field of the Newton–Andrews method. As examples, we apply the results to the Chu–Vandermonde–Gauss formula and the Dougall–Dixon theorem and obtain a series of harmonic number identities. This paper generalizes some works presented before and provides a way to establish infinite harmonic number identities.     

Effective models for reactive flow under a dominant Péclet number and order one Damköhler number: Numerical simulations

The paper is devoted to the longitudinal dispersion of a soluble substance released in a steady laminar flow through a slit channel with heterogeneous reaction at the outer wall. The reactive transport happens in the presence of a dominant Péclet number and order one Damköhler number. In particular, these Péclet numbers correspond to Taylor’s dispersion regime. An effective model for the enhanced diffusion in this context was derived recently. It contains memory effects and contributions to the effective diffusion and effective advection velocity, due to the flow and chemistry reaction regime. In the present paper, we show through numerical simulations the efficiency of this new model. In particular, using Taylor’s ‘historical’ parameters, we illustrate that our derived contributions are important and that using them is necessary in order to simulate correctly the reactive flows. We emphasize three main points. First, we show how the effective diffusion is enhanced by chemical effects at dispersive times. Second, our model captures an intermediate regime where the diffusion is anomalous and the distribution is asymmetric. Third, we show how the chemical effects also slow down the average speed of the front.     

The number of integer points on Vinogradov’s quadric

An asymptotic formula is obtained for the number of integer solutions of bounded height on Vinogradov’s quadric. Two leading terms are determined, and a strong estimate for the error term is given.     

The potential-Ramsey number of Kn and K t −k

Czechoslovak Mathematical Journal - A nonincreasing sequence π = (d1,…, dn) of nonnegative integers is a graphic sequence if it is realizable by a simple graph G on n vertices. In this...     

Modeling the number of insureds’ cars using queuing theory

In this paper, we propose to model the number of insured cars per household. We use queuing theory to construct a new model that needs 4 different parameters: one that describes the rate of addition of new cars on the insurance contract, a second one that models the rate of removal of insured vehicles, a third parameter that models the cancellation rate of the insurance policy, and finally a parameter that describes the rate of renewal. Statistical inference techniques allow us to estimate each parameter of the model, even in the case where there is censorship of data. We also propose to generalize this new queuing process by adding some explanatory variables into each parameter of the model. This allows us to determine which policyholder’s profiles are more likely to add or remove vehicles from their insurance policy, to cancel their contract or to renew annually. The estimated parameters help us to analyze the insurance portfolio in detail because the queuing theory model allows us to compute various kinds of useful statistics for insurers, such as the expected number of cars insured or the customer lifetime value that calculates the discounted future profits of an insured. Using car insurance data, a numerical illustration based on a portfolio from a Canadian insurance company is included to support this discussion.