Related papers: On the M\"obius Function and Topology of General P…
We present a framework for the complexity classification of parameterized counting problems that can be formulated as the summation over the numbers of homomorphisms from small pattern graphs H_1,...,H_l to a big host graph G with the…
In this paper we give an algorithm to determine, for any given suborder closed class of series-parallel posets, a structure theorem for the class. We refer to these structure theorems as structural descriptions.
We review how some multianalytic inner functions of the Beurling type theorem are associated to row contractions following works of G.Popescu. Motivated by a result on weak Markov dilations, we define a notion of characteristic function for…
We formalize and study the natural approach of designing convex surrogate loss functions via embeddings, for problems such as classification, ranking, or structured prediction. In this approach, one embeds each of the finitely many…
We investigate the Hilbert complex of elasticity involving spaces of symmetric tensor fields. For the involved tensor fields and operators we show closed ranges, Friedrichs/Poincare type estimates, Helmholtz type decompositions, regular…
The rowmotion operator acting on the set of order ideals of a finite poset has been the focus of a significant amount of recent research. One of the major goals has been to exhibit homomesies: statistics that have the same average along…
We introduce a construction called realisation which transforms posets into posets. We show that realisations share several key features with upper semilattices. For example, we define local dimensions of points in a poset and show that…
This paper examines the structure of poset matrices by formulating a set of new construction rules for this purpose. In this direction, the technique of partial composition operation will be introduced as the basis for the construction of…
Tabular foundation models aim to learn universal representations of tabular data that transfer across tasks and domains, enabling applications such as table retrieval, semantic search and table-based prediction. Despite the growing number…
We study classes of objects whose combinatorics are closely related to those of posets. The framework of operads and operad algebras allows us to make this relationship precise and provides tools for a deeper understanding of their…
In this paper, Peetre's conjecture about the real interpolation space of Besov space {\bf is solved completely } by using the classification of vertices of cuboids defined by {\bf wavelet coefficients and wavelet's grid structure}.…
Let $\mathfrak{m}$ be a random tessellation in $\mathbf{R}^d$ observed in a bounded Borel subset $W$ and $f(\cdot)$ be a measurable function defined on the set of convex bodies. To each cell $C$ of $\mathfrak{m}$ we associate a point $z(C)$…
In our previous papers, together with J. Paseka we introduced so-called sectionally pseudocomplemented lattices and posets and illuminated their role in algebraic constructions. We believe that - similar to relatively pseudocomplemented…
We explore a novel method to generate and characterize complex networks by means of their embedding on hyperbolic surfaces. Evolution through local elementary moves allows the exploration of the ensemble of networks which share common…
We give a complete classification of the factorial functions of Eulerian binomial posets. The factorial function B(n) either coincides with $n!$, the factorial function of the infinite Boolean algebra, or $2^{n-1}$, the factorial function…
We introduce tests for the goodness of fit of point patterns via methods from topological data analysis. More precisely, the persistent Betti numbers give rise to a bivariate functional summary statistic for observed point patterns that is…
Network-structured data becomes ubiquitous in daily life and is growing at a rapid pace. It presents great challenges to feature engineering due to the high non-linearity and sparsity of the data. The local and global structure of the…
In this paper, we prove common fixed point results for a self-mappings satisfying an implicit function which is general enough to cover a multitude of known as well as unknown contractions. Our results modify, unify, extend and generalize…
Multiparameter persistent homology has emerged as a powerful generalization of topological data analysis, capable of encoding multivariate filtrations. However, the algebraic complexity of multiparameter persistence modules, marked by wild…
In this work, we employ the concept of {\em composite representation} of Boolean functions, which represents an arbitrary Boolean function as a composition of one Boolean function and one vectorial function, for the purpose of specifying…