Intelligent Systems.
Theory and Applications

(Intellektual'nye Sistemy. Teoriya i Prilozheniya)

Asymptotically optimal one-sided embeddings of ternary trees of similar formulas into rectangular grids

Abstract

The problem of constructing one-sided embeddings of ternary trees of formulas similar to given formulas with negations pushed down to the variables, over a basis of commutative and associative operations, into rectangular grids is considered. For an arbitrary initial formula, estimates are obtained for the depth of a similar formula and for the height of a rectangular grid admitting a canonical embedding of its tree.

Keywords: formula trees; similar formulas; embeddings; rectangular grids;.

BibTeX
@article{IS-Lozhkin-Mo2026,
  author  = {Lozhkin, Sergey Andreevich and Mo, Di},
  title   = {{Asymptotically optimal one-sided embeddings of ternary trees of similar formulas into rectangular grids}},
  journal = {Intelligent Systems. Theory and Applications},
  year    = {2026},
  volume  = {30},
  number  = {4},
  pages   = {216--219},
}
AMSBIB
\Bibitem{IS-Lozhkin-Mo2026}
\by S.\,A.~Lozhkin, D.~Mo
\paper Asymptotically optimal one-sided embeddings of ternary trees of similar formulas into rectangular grids
\jour Intelligent Systems. Theory and Applications
\yr 2026
\vol 30
\issue 4
\pages 216--219
\lang In Russian
Published under Creative Commons Attribution 4.0 International (CC BY 4.0)

← Back to issue

× Issue cover