相关论文: Club guessing and the universal models

The distribution function of particles over clusters is proposed for a system of identical intersecting spheres, the centres of which are uniformly distributed in space. Consideration is based on the concept of the rank number of clusters,…

The clustering coefficient is a valuable tool for understanding the structure of complex networks. It is widely used to analyze social networks, biological networks, and other complex systems. While there is generally a single common…

In this paper, we examine the problem of partial inference in the context of structured prediction. Using a generative model approach, we consider the task of maximizing a score function with unary and pairwise potentials in the space of…

We introduce the notion of a dilation for a partial representation (i.e. a partial module) of a Hopf algebra, which in case the partial representation origins from a partial action (i.e.a partial module algebra) coincides with the…

We extend the Coupon Collector's Problem (CCP) and present a novel generalized model, referred as the k-LCCP problem, where one is interested in recovering a bipartite graph with a perfect matching, which represents the coupons and their…

Single-image 3D shape reconstruction is an important and long-standing problem in computer vision. A plethora of existing works is constantly pushing the state-of-the-art performance in the deep learning era. However, there remains a much…

Recently, a proposal has been advanced to detect unconstitutional partisan gerrymandering with a simple formula called the efficiency gap. The efficiency gap is now working its way towards a possible landmark case in the Supreme Court. This…

Compositional generalization is a critical ability in learning and decision-making. We focus on the setting of reinforcement learning in object-oriented environments to study compositional generalization in world modeling. We (1) formalize…

This paper explores generalised probabilistic modelling and uncertainty estimation in comparative LLM-as-a-judge frameworks. We show that existing Product-of-Experts methods are specific cases of a broader framework, enabling diverse…

The problem of guessing a random string is revisited. A close relation between guessing and compression is first established. Then it is shown that if the sequence of distributions of the information spectrum satisfies the large deviation…

We study the cohomology rings of tiling spaces $\Omega$ given by cubical substitutions. While there have been many calculations before of cohomology groups of such tiling spaces, the innovation here is that we use computer-assisted methods…

Let $\mathcal{C}$ be a finitely bicomplete category and $\mathcal{W}$ a subcategory. We prove that the existence of a model structure on $\mathcal{C}$ with $\mathcal{W}$ as subcategory of weak equivalence is not first order expressible.…

An algebraic category $\mathcal{C}$ is called balanced if the cotriple cohomology of any object of $\mathcal{C}$ vanishes in positive dimensions on injective coefficient modules. Important examples of balanced and of non-balanced categories…

We give a general notion of combinatory completeness with respect to a faithful cartesian club and use it systematically to obtain characterisations of a number of different kinds of applicative system. Each faithful cartesian club…

Rich-club and page-club coefficients and their null models are introduced for directed graphs. Null models allow for a quantitative discussion of the rich-club and page-club phenomena. These coefficients are computed for four directed…

Using a well-ordering on the reals, one can prove there exists a partition of the three-dimensional Euclidean space into unit circles (PUC). We show that the converse does not hold: there exist models of $\mathsf{ZF}$ without a…

We enumerate factorizations of a Coxeter element in a well generated complex reflection group into arbitrary factors, keeping track of the fixed space dimension of each factor. In the infinite families of generalized permutations, our…

Bj\"orner and Wachs introduced CL-shellability as a technique for studying the topological structure of order complexes of partially ordered sets (posets). They also introduced the notion of recursive atom ordering, and they proved that a…

We study the structure of separable elements in bipartite C$^{\ast}$-algebras, focusing on the existence and size of a separable neighbourhood around the identity element. While this phenomenon is well understood in the finite-dimensional…

Physical Unclonable Functions can be used for secure key generation in cryptographic applications. It is explained how methods from coding theory must be applied in order to ensure reliable key regeneration. Based on previous work, we show…