scholarly journals Alternative proof on the crossing number of $K_{2;3;n}$

2019 ◽  
Vol 7 (1) ◽  
Author(s):  
Michal Staš
Keyword(s):  
Crossing Number ◽  
Alternative Proof

scholarly journals ALTERNATIVE PROOF ON THE CROSSING NUMBER OF K1,1,3,N

2019 ◽  
Vol 19 (1) ◽  
pp. 19-24
Author(s):  
Michal STAŠ ◽  
Keyword(s):  
Crossing Number ◽  
Alternative Proof

Remarks on nonlinear elastic waves with null conditions

2020 ◽  
Vol 26 ◽  
pp. 121
Author(s):  
Dongbing Zha ◽  
Weimin Peng
Keyword(s):  
Initial Data ◽  
Global Existence ◽  
Elastic Waves ◽  
Wave Equations ◽  
Alternative Proof ◽  
Classical Solutions ◽  
Small Initial Data ◽  
Hyperelastic Materials ◽  
Variational Structure ◽  
Nonlinear Elastic

For the Cauchy problem of nonlinear elastic wave equations for 3D isotropic, homogeneous and hyperelastic materials with null conditions, global existence of classical solutions with small initial data was proved in R. Agemi (Invent. Math. 142 (2000) 225–250) and T. C. Sideris (Ann. Math. 151 (2000) 849–874) independently. In this paper, we will give some remarks and an alternative proof for it. First, we give the explicit variational structure of nonlinear elastic waves. Thus we can identify whether materials satisfy the null condition by checking the stored energy function directly. Furthermore, by some careful analyses on the nonlinear structure, we show that the Helmholtz projection, which is usually considered to be ill-suited for nonlinear analysis, can be in fact used to show the global existence result. We also improve the amount of Sobolev regularity of initial data, which seems optimal in the framework of classical solutions.

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 CYLINDRICAL CROSSING NUMBER OF ZERO DIVISOR GRAPHS

2020 ◽  
Vol 9 (8) ◽  
pp. 5901-5908
Author(s):  
M. Sagaya Nathan ◽  
J. Ravi Sankar
Keyword(s):  
Zero Divisor ◽  
Crossing Number

scholarly journals Join Products K2,3 + Cn

Mathematics ◽  
2020 ◽  
Vol 8 (6) ◽  
pp. 925
Author(s):  
Michal Staš
Keyword(s):  
Bipartite Graph ◽  
Complete Bipartite Graph ◽  
Crossing Number ◽  
Arithmetic Means ◽  
Minimum Number ◽  
Edge Crossings

The crossing number cr ( G ) of a graph G is the minimum number of edge crossings over all drawings of G in the plane. The main goal of the paper is to state the crossing number of the join product K 2 , 3 + C n for the complete bipartite graph K 2 , 3 , where C n is the cycle on n vertices. In the proofs, the idea of a minimum number of crossings between two distinct configurations in the various forms of arithmetic means will be extended. Finally, adding one more edge to the graph K 2 , 3 , we also offer the crossing number of the join product of one other graph with the cycle C n .

scholarly journals Improvement on the Crossing Number of Crossing-Critical Graphs

2020 ◽  
Author(s):  
János Barát ◽  
Géza Tóth
Keyword(s):  
Crossing Number ◽  
Critical Graphs ◽  
Minimum Number ◽  
Edge Crossings

AbstractThe crossing number of a graph G is the minimum number of edge crossings over all drawings of G in the plane. A graph G is k-crossing-critical if its crossing number is at least k, but if we remove any edge of G, its crossing number drops below k. There are examples of k-crossing-critical graphs that do not have drawings with exactly k crossings. Richter and Thomassen proved in 1993 that if G is k-crossing-critical, then its crossing number is at most $$2.5\, k+16$$ 2.5 k + 16 . We improve this bound to $$2k+8\sqrt{k}+47$$ 2 k + 8 k + 47 .

scholarly journals A short note on extreme points of certain polytopes

2020 ◽  
Vol 8 (1) ◽  
pp. 36-39
Author(s):  
Lei Cao ◽  
Ariana Hall ◽  
Selcuk Koyuncu
Keyword(s):  
Short Proof ◽  
Convex Polytopes ◽  
Short Note ◽  
Convex Polytope ◽  
Extreme Points ◽  
Alternative Proof ◽  
Stochastic Matrices ◽  
Doubly Stochastic ◽  
Birkhoff's Theorem ◽  
Birkhoff’S Theorem

AbstractWe give a short proof of Mirsky’s result regarding the extreme points of the convex polytope of doubly substochastic matrices via Birkhoff’s Theorem and the doubly stochastic completion of doubly sub-stochastic matrices. In addition, we give an alternative proof of the extreme points of the convex polytopes of symmetric doubly substochastic matrices via its corresponding loopy graphs.

scholarly journals On Polish groups admitting non-essentially countable actions

2020 ◽  
pp. 1-15
Author(s):  
ALEXANDER S. KECHRIS ◽  
MACIEJ MALICKI ◽  
ARISTOTELIS PANAGIOTOPOULOS ◽  
JOSEPH ZIELINSKI
Keyword(s):  
Equivalence Relation ◽  
Isometry Group ◽  
Alternative Proof ◽  
Orbit Equivalence ◽  
Locally Compact ◽  
Continuous Action ◽  
Polish Groups ◽  
Infinite Dimensional ◽  
Open Question ◽  
New Criterion

Abstract It is a long-standing open question whether every Polish group that is not locally compact admits a Borel action on a standard Borel space whose associated orbit equivalence relation is not essentially countable. We answer this question positively for the class of all Polish groups that embed in the isometry group of a locally compact metric space. This class contains all non-archimedean Polish groups, for which we provide an alternative proof based on a new criterion for non-essential countability. Finally, we provide the following variant of a theorem of Solecki: every infinite-dimensional Banach space has a continuous action whose orbit equivalence relation is Borel but not essentially countable.

scholarly journals On equicontinuous factors of flows on locally path-connected compact spaces

2020 ◽  
pp. 1-18
Author(s):  
NIKOLAI EDEKO
Keyword(s):  
Lie Group ◽  
Metric Space ◽  
Betti Number ◽  
Alternative Proof ◽  
Simple Consequence ◽  
Compact Metric Space ◽  
Invariant Functions ◽  
Compact Spaces ◽  
Path Connected

Abstract We consider a locally path-connected compact metric space K with finite first Betti number $\textrm {b}_1(K)$ and a flow $(K, G)$ on K such that G is abelian and all G-invariant functions $f\,{\in}\, \text{\rm C}(K)$ are constant. We prove that every equicontinuous factor of the flow $(K, G)$ is isomorphic to a flow on a compact abelian Lie group of dimension less than ${\textrm {b}_1(K)}/{\textrm {b}_0(K)}$ . For this purpose, we use and provide a new proof for Theorem 2.12 of Hauser and Jäger [Monotonicity of maximal equicontinuous factors and an application to toral flows. Proc. Amer. Math. Soc.147 (2019), 4539–4554], which states that for a flow on a locally connected compact space the quotient map onto the maximal equicontinuous factor is monotone, i.e., has connected fibers. Our alternative proof is a simple consequence of a new characterization of the monotonicity of a quotient map $p\colon K\to L$ between locally connected compact spaces K and L that we obtain by characterizing the local connectedness of K in terms of the Banach lattice $\textrm {C}(K)$ .

An alternative proof of Kharitonov's theorem

1989 ◽  
Vol 34 (4) ◽  
pp. 448-450 ◽  
Author(s):  
H. Chapellat ◽  
S.P. Bhattacharyya
Keyword(s):  
Alternative Proof ◽  
Kharitonov’S Theorem ◽  
Kharitonov's Theorem
Sign in / Sign up

Export Citation Format

Share Document