Related papers: Laplaza Sets, or How to Select Coherence Diagrams …
There are 2^n possible resolutions of a smooth pseudodiagram with n precrossings. If we consider piecewise-linear (PL) pseudodiagrams and resolutions that themselves are PL, certain resolutions of the pseudodiagram may not exist in…
Pseudo-Labeling is a simple and effective approach to semi-supervised learning. It requires criteria that guide the selection of pseudo-labeled data. The latter have been shown to crucially affect pseudo-labeling's generalization…
Lattice-theoretic ideals have been used to define and generate non granular rough approximations over general approximation spaces over the last few years by few authors. The goal of these studies, in relation based rough sets, have been to…
We generalise the existence of combinatorial designs to the setting of subset sums in lattices with coordinates indexed by labelled faces of simplicial complexes. This general framework includes the problem of decomposing hypergraphs with…
This article presents a study of an algebra spanned by the faces of a hyperplane arrangement. The quiver with relations of the algebra is computed and the algebra is shown to be a Koszul algebra. It is shown that the algebra depends only on…
The concept of "table algebra" was introduced by Z Arad anf H. Blau in order to study in a uniform way properties of products of conjugacy classes and of irreducible characters of a finite group, Except for certain cases which remain open,…
Inspired by the notion of action convergence in graph limit theory, we introduce a measure-theoretic representation of matrices, and we use it to define a new notion of pseudo-metric on the space of matrices. Moreover, we show that such…
We introduce P-graphs, which are generalisations of directed graphs in which paths have a degree in a semigroup P rather than a length in N. We focus on semigroups P arising as part of a quasi-lattice ordered group (G,P) in the sense of…
Subobject independence as morphism co-possibility has recently been defined in [2] and studied in the context of algebraic quantum field theory. This notion of independence is handy when it comes to systems coming from physics, but when…
Starting from any unital colored PROP $P$, we define a category $P(P)$ of shapes called $P$-propertopes. Presheaves on $P(P)$ are called $P$-propertopic sets. For $0 \leq n \leq \infty$ we define and study $n$-time categorified $P$-algebras…
Matrix congruence can be used to mimic linear maps between homogeneous quadratic polynomials in $n$ variables. We introduce a generalization, called standard-form congruence, which mimics affine maps between non-homogeneous quadratic…
We develop further the algebra of cospans and spans of graphs introduced by Katis, Sabadini and Walters for the sequential and parallel composition of processes, adding here data types.
We introduce a method to define $C^*$-algebras from $C^*$-correspondences. Our construction generalizes Cuntz-Pimsner algebras, crossed products by Hilbert $C^*$-modules, and graph algebras.
Lopsided sets were introduced by Jim Lawrence in 1983 when he studied the subsets of $\{-1,+1\}^E$ that encode the intersection pattern of a convex set $K$ with the orthants of ${\mathbb R}^E$. Lopsided sets have been independently…
In this paper we focus on the problem of finding (small) subhypergraphs in a (large) hypergraph. We use this problem to illustrate that reducing hypergraph problems to graph problems by working with the 2-section is not always a reasonable…
Many uncertainty sets encountered in control systems analysis and design can be expressed in terms of semialgebraic sets, that is as the intersection of sets described by means of polynomial inequalities. Important examples are for instance…
Analysis sparsity is a common prior in inverse problem or machine learning including special cases such as Total Variation regularization, Edge Lasso and Fused Lasso. We study the geometry of the solution set (a polyhedron) of the analysis…
In this paper we study a Lie-theoretic analogue of a generalisation of the prefrattini subgroups introduced by W. Gasch\"utz. The approach follows that of P. Hauck and H. Kurtzweil for groups, by first considering complements in subalgebra…
The paper studies the structure of restricted Leibniz algebras. More specifically speaking, we first give the equivalent definition of restricted Leibniz algebras, which is by far more tractable than that of a restricted Leibniz algebras in…
Distance-regular graphs are a class of regualr graphs with pretty combinatorial symmetry. In 2007, Miklavi\v{c} and Poto\v{c}nik proposed the problem of charaterizing distance-regular Cayley graphs, which can be viewed as a natural…