scholarly journals Lower bound cluster algebras: presentations, Cohen–Macaulayness, and normality

2018 ◽  
Vol 1 (1) ◽  
pp. 95-114 ◽  
Author(s):  
Greg Muller ◽  
Jenna Rajchgot ◽  
Bradley Zykoski
Keyword(s):  
Lower Bound ◽  
Cluster Algebras

scholarly journals Geometric vertex decomposition and liaison

2021 ◽  
Vol 9 ◽  
Author(s):  
Patricia Klein ◽  
Jenna Rajchgot
Keyword(s):  
Lower Bound ◽  
Cluster Algebras ◽  
Algebraic Varieties ◽  
Determinantal Ideals ◽  
Vertex Decomposable

Abstract Geometric vertex decomposition and liaison are two frameworks that have been used to produce similar results about similar families of algebraic varieties. In this paper, we establish an explicit connection between these approaches. In particular, we show that each geometrically vertex decomposable ideal is linked by a sequence of elementary G-biliaisons of height $1$ to an ideal of indeterminates and, conversely, that every G-biliaison of a certain type gives rise to a geometric vertex decomposition. As a consequence, we can immediately conclude that several well-known families of ideals are glicci, including Schubert determinantal ideals, defining ideals of varieties of complexes and defining ideals of graded lower bound cluster algebras.

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$.

Sign in / Sign up

Export Citation Format

Share Document