scholarly journals Lower Bound of Zero-visibility Cops and Robber Game on the Cube Grid

2020 ◽  
Author(s):  
Jiahui Wang ◽  
Farong Zhong
Keyword(s):  
Lower Bound ◽  
Classical Model ◽  
Quadratic Polynomial ◽  
Partition Problem ◽  
Cops And Robber

Zero-visibility cops and robber game is a variant of the classical model. The robber is invisible in the zero-visibility game. In this paper, we study the zero-visibility cops and robber game on the cube grid. We first study a partition problem of the cube grid. Then we prove the lower bound on the zero-visibility cop number of the cube grid by using the results in the partition. We also show the lower bound is a quadratic polynomial about n.

AN Ω(log n−k log k) TIME LINEAR COST LOWER BOUND FOR THE k FUNCTIONS COARSEST PARTITION PROBLEM

1996 ◽  
Vol 06 (02) ◽  
pp. 195-202
Author(s):  
CLIVE N. GALLEY
Keyword(s):  
Lower Bound ◽  
Partition Problem ◽  
Model Of Computation ◽  
Pram Model ◽  
Linear Cost ◽  
Time Linear ◽  
Crcw Pram

We consider the k functions coarsest partition problem for a set S, where |S|=n, and k functions from S to S. We present an Ω(log n−k log k) time, linear work, lower bound for this problem on the CRCW PRAM model of computation.

The Solvability of Polynomial Pell’s Equation

2020 ◽  
Vol 25 (2) ◽  
pp. 125-132
Author(s):  
Bal Bahadur Tamang ◽  
Ajay Singh
Keyword(s):  
Trivial Solution ◽  
Continued Fraction ◽  
Laurent Series ◽  
Quadratic Polynomial ◽  
Continued Fraction Expansion ◽  
Pell’S Equation ◽  
Integer Polynomials

This article attempts to describe the continued fraction expansion of ÖD viewed as a Laurent series x-1. As the behavior of the continued fraction expansion of ÖD is related to the solvability of the polynomial Pell’s equation p2-Dq2=1  where D=f2+2g  is monic quadratic polynomial with deg g<deg f  and the solutions p, q  must be integer polynomials. It gives a non-trivial solution if and only if the continued fraction expansion of ÖD  is periodic.

The least distance between extremums and minimal period of solutions to autonomous vector differential equations

2019 ◽  
Vol 485 (2) ◽  
pp. 142-144
Author(s):  
A. A. Zevin
Keyword(s):  
Lower Bound ◽  
Differential Equations ◽  
Periodic Solutions ◽  
Lipschitz Constant ◽  
Minimal Period ◽  
Arbitrary Vector ◽  
Vector Norm ◽  
Sharp Lower Bound

Solutions x(t) of the Lipschitz equation x = f(x) with an arbitrary vector norm are considered. It is proved that the sharp lower bound for the distances between successive extremums of xk(t) equals π/L where L is the Lipschitz constant. For non-constant periodic solutions, the lower bound for the periods is 2π/L. These estimates are achieved for norms that are invariant with respect to permutation of the indices.

A Lower Bound for Schur Numbers and Multicolor Ramsey Numbers

10.37236/1188 ◽  
1994 ◽  
Vol 1 (1) ◽  
Author(s):  
Geoffrey Exoo
Keyword(s):  
Lower Bound ◽  
Lower Bounds ◽  
Ramsey Numbers

For $k \geq 5$, we establish new lower bounds on the Schur numbers $S(k)$ and on the k-color Ramsey numbers of $K_3$.

On the Crossing Number of $K_{m,n}$

10.37236/1748 ◽  
2003 ◽  
Vol 10 (1) ◽  
Author(s):  
Nagi H. Nahas
Keyword(s):  
Lower Bound ◽  
Bipartite Graph ◽  
Complete Bipartite Graph ◽  
Crossing Number

The best lower bound known on the crossing number of the complete bipartite graph is : $$cr(K_{m,n}) \geq (1/5)(m)(m-1)\lfloor n/2 \rfloor \lfloor(n-1)/2\rfloor$$ In this paper we prove that: $$cr(K_{m,n}) \geq (1/5)m(m-1)\lfloor n/2 \rfloor \lfloor (n-1)/2 \rfloor + 9.9 \times 10^{-6} m^2n^2$$ for sufficiently large $m$ and $n$.

The d-Subtree Partition Problem

2010 ◽  
Vol 33 (4) ◽  
pp. 652-665
Author(s):  
Yan-Guang CAI ◽  
Yun ZHANG ◽  
Ji-Xin QIAN
Keyword(s):  
Partition Problem
Sign in / Sign up

Export Citation Format

Share Document