Advanced Search

Match of the following rules

Add Sub-clause

Add Another Rule

Contains the following math formula (red border means the formula is incomplete)

Formula preview

The search session has expired. Please query the service again.

Currently displaying 1 – 2 of 2

Order by Relevance | Title | Year of publication

Bounds for orthogonal 3-D graph drawing.

Biedl, T.; Shermer, T.; Whitesides, S.; Wismath, S. — 1999

Journal of Graph Algorithms and Applications

2-normalization of lattices

Ivan Chajda; W. Cheng; S. L. Wismath — 2008

Czechoslovak Mathematical Journal

Let $τ$ be a type of algebras. A valuation of terms of type $τ$ is a function $v$ assigning to each term $t$ of type $τ$ a value $v (t) \geq 0$ . For $k \geq 1$ , an identity $s \approx t$ of type $τ$ is said to be $k$ -normal (with respect to valuation $v$ ) if either $s = t$ or both $s$ and $t$ have value $\geq k$ . Taking $k = 1$ with respect to the usual depth valuation of terms gives the well-known property of normality of identities. A variety is called $k$ -normal (with respect to the valuation $v$ ) if all its identities are $k$ -normal. For any variety $V$ , there is a least...

Page 1

Download Results (CSV)