Related papers: On positive local combinatorial dividing-lines in …

In this paper, we define locally matchable subsets of a group which is derived from the concept of matchings in groups and used as a tool to give alternative proofs for existing results in matching theory. We also give the linear analogue…

Let us say that a class of upward closed sets (upsets) of distributive lattices is a finitary filter class if it is closed under homomorphic preimages, intersections, and directed unions. We show that the only finitary filter classes of…

A filter lattice is a distributive lattice formed by all filters of a poset in the anti-inclusion order. We study the combinatorial properties of the Hasse diagrams of filter lattices of certain posets, so called Fibonacci-like cubes, in…

On a finite structure, the polymorphism invariant relations are exactly the primitively positively definable relations. On infinite structures, these two sets of relations are different in general. Infinitary primitively positively…

We establish a Dwyer-Kan equivalence of relative categories of combinatorial model categories, presentable quasicategories, and other models for locally presentable (infinity,1)-categories. This implies that the underlying quasicategories…

This paper deals with join-semilattices whose sections, i.e. principal filters, are pseudocomplemented lattices. The pseudocomplement of a\vee b in the section [b,1] is denoted by a\rightarrow b and can be considered as the connective…

Normalizing Flows are a promising new class of algorithms for unsupervised learning based on maximum likelihood optimization with change of variables. They offer to learn a factorized component representation for complex nonlinear data and,…

We propose a conjectural extension to positive characteristic case of a well known Deligne's theorem on the existence of super fiber functors. We prove our conjecture in the special case of semisimple categories with finitely many…

By topological arguments, we prove new results on the existence, non-existence, localization and multiplicity of nontrivial solutions of a class of perturbed nonlinear integral equations. These type of integral equations arise, for example,…

We continue our study of topological partial *-algebras, focusing our attention to *-semisimple partial *-algebras, that is, those that possess a {multiplication core} and sufficiently many *-representations. We discuss the respective roles…

We apply a categorical lens to the study of betweenness relations by capturing them within a topological category, fibred in lattices, and study several subcategories of it. In particular, we show that its full subcategory of finite objects…

We make an application of ideas from partition theory to a problem in multiplicative number theory. We propose a deterministic model of prime number distribution, from first principles related to properties of integer partitions, that…

We study a family of determinantal ideals whose decompositions encode the structural zeros in conditional independence models with hidden variables. We provide explicit decompositions of these ideals and, for certain subclasses of models,…

This paper aims to develop a theory of projective and affine structures on higher-dimensional varieties in positive characteristic. This theory deals with Frobenius-projective and Frobenius-affine structures, which have been previously…

This text provides an introduction to distributed local algorithms -- an area at the intersection of theoretical computer science and discrete mathematics. We collect recent results in the area and demonstrate how they lead to a clean…

In this paper, we define locally matchable subsets of a group which is extracted from the concept of matchings in groups and used as a tool to give alternative proofs for existing results in matching theory. We also give the linear analogue…

We pursue tractable Bayesian analysis of generalized linear models (GLMs) for categorical data. Thus far, GLMs are difficult to scale to more than a few dozen categories due to non-conjugacy or strong posterior dependencies when using…

We classify essential algebras whose irredundant non-refinable covers consist of primal algebras. The proof is obtained by constructing one to one correspondence between such algebras and partial orders on finite sets. Further, we prove…

Let $(\mathfrak{g},[p])$ be a finite dimensional restricted Lie algebra over a perfect field $\mathbbm{k}$ of characteristic $p\!\ge \!3$. By combining methods from recent work of Benson-Carlson \cite{BC20} with those of \cite{CF21,Fa17} we…

The problem of developing binary classifiers from positive and unlabeled data is often encountered in machine learning. A common requirement in this setting is to approximate posterior probabilities of positive and negative classes for a…