Related papers: Widths of function classes on sets with tree-like …
We introduce monoidal width as a measure of the difficulty of decomposing morphisms in monoidal categories. For graphs, we show that monoidal width and two variations capture existing notions, namely branch width, tree width and path width.…
In this paper we study geometric aspects of Ball's classes in the context of nonlinear elasticity problems. The suggested approach is based on the characterization of Ball's classes $A_{q,q'}(\Omega)$ in terms of composition operators on…
In the present work, new classes of wavelet functions are presented in the framework of Clifford analysis. Firstly, some classes of new monogenic polynomials are provided based on 2-parameters weight functions. Such classes extend the well…
We define and prove isomorphisms between three combinatorial classes involving labeled trees. We also give an alternative proof by means of generating functions.
In this paper we consider the directed path-width and directed tree-width of recursively defined digraphs. As an important combinatorial tool, we show how the directed path-width and the directed tree-width can be computed for the disjoint…
In this paper we establish a new class of weighted Hardy-Sobolev type inequalities under mild monotonicity assumptions on the weight function. As a consequence, we derive the corresponding weighted Sobolev and trace-type inequalities. These…
In this paper we obtain order estimates for the Kolmogorov widths of the set $B_{p_0}^m\cap \nu B_{p_1}^m$ in $l_q^m$; here $0\le n\le m/2$, $p_0>p_1$, $q<\infty$.
In this paper, we introduce two families of planar and self-similar graphs which have small-world properties. The constructed models are based on an iterative process where each step of a certain formulation of modules results in a final…
By the Grid Minor Theorem of Robertson and Seymour, every graph of sufficiently large tree-width contains a large grid as a minor. Tree-width may therefore be regarded as a measure of 'grid-likeness' of a graph. The grid contains a long…
Treewidth and Hadwiger number are two of the most important parameters in structural graph theory. This paper studies graph classes in which large treewidth implies the existence of a large complete graph minor. To formalise this, we say…
We present a probabilistic interpretation of several functional isoperimetric inequalities within the class of $p$-concave functions, building on random models for such functions introduced by P. Pivovarov and J. Rebollo-Bueno. First, we…
Treewidth is a graph parameter of fundamental importance to algorithmic and structural graph theory. This paper surveys several graph parameters tied to treewidth, including separation number, tangle number, well-linked number and Cartesian…
We introduce monoidal width as a measure of complexity for morphisms in monoidal categories. Inspired by well-known structural width measures for graphs, like tree width and rank width, monoidal width is based on a notion of syntactic…
We consider the proof system Res($\oplus$) introduced by Itsykson and Sokolov (Ann. Pure Appl. Log.'20), which is an extension of the resolution proof system and operates with disjunctions of linear equations over $\mathbb{F}_2$. We study…
We introduce two kinds of generalized $s$-convex functions on real linear fractal sets $\mathbb{R}^{\alpha}(0<\alpha<1)$. And similar to the class situation, we also study the properties of these two kinds of generalized $s$-convex…
We present families of combinatorial classes described as trees with nodes that can carry one of two types of "flowers": integer partitions or integer compositions. Two parameters on the flowers of trees will be considered: the number of…
We propose a tree-based algorithm for classification and regression problems in the context of functional data analysis, which allows to leverage representation learning and multiple splitting rules at the node level, reducing…
We consider random binary trees that appear as the output of certain standard algorithms for sorting and searching if the input is random. We introduce the subtree size metric on search trees and show that the resulting metric spaces…
For fixed $t\ge 2$, we consider the class of representations of $1$ as sum of unit fractions whose denominators are powers of $t$ or equivalently the class of canonical compact $t$-ary Huffman codes or equivalently rooted $t$-ary plane…
We study the enumeration problem for different kind of tree parking functions introduced recently, called tree parking functions, tree parking distributions, prime tree parking functions, and prime tree parking distributions, for rooted…