Related papers: LCLs in the Borel Hierarchy
A classification algorithm, called the Linear Centralization Classifier (LCC), is introduced. The algorithm seeks to find a transformation that best maps instances from the feature space to a space where they concentrate towards the center…
In this work we study the uncountable Borel chromatic numbers, defined by Geschke (2011) as cardinal characteristics of the continuum, of low complexity graphs. We show that a strong form of locally countable graphs with compact totally…
We study some natural sets arising in the theory of ordinary differential equations in one variable from the point of view of descriptive set theory and in particular classify them within the Borel hierarchy. We prove that the set of Cauchy…
Let $X$ be a Polish space and $K$ a separable compact subset of the first Baire class on $X$. For every sequence $\bs$ dense in $\kk$, the descriptive set-theoretic properties of the set \[ \lbf=\{L\in[\nn]: (f_n)_{n\in L} \text{is…
Logarithmic Conformal Field Theories (LCFT) play a key role, for instance, in the description of critical geometrical problems (percolation, self avoiding walks, etc.), or of critical points in several classes of disordered systems…
We construct a smooth locally finite Borel graph $G$ and a local coloring problem $\Pi$ such that $G$ has a coloring $V(G) \to \mathbb{N}$ that solves $\Pi$, but no such coloring can be Borel.
The WL-rank of a digraph $\Gamma$ is defined to be the rank of the coherent configuration of $\Gamma$. We construct a new infinite family of strictly Deza Cayley graphs for which the WL-rank is equal to the number of vertices. The graphs…
The study of global deformations of Lie algebras is related to the problem of classification of simple Lie algebras over fields of small characteristic. The classification of finite-dimensional simple Lie algebras is complete over…
Goldman and Turaev found a Lie bialgebra structure on the vector space generated by non-trivial free homotopy classes of curves on a surface. When the surface has non-empty boundary, this vector space has a basis of cyclic reduced words in…
We introduce the most general class of linear boundary-value problems for systems of first-order ordinary differential equations whose solutions belong to the complex H\"older space $C^{n+1,\alpha}$, with $0\leq n\in\mathbb{Z}$ and…
We propose a generalized GPU-based connected component labeling (CCL) algorithm that can be applied to both various lattices and to non-lattice environments in a uniform fashion. We extend our recent GPU-based CCL algorithm without the use…
The critical point between varieties A and B of algebras is defined as the least cardinality of the semilattice of compact congruences of a member of A but of no member of B, if it exists. The study of critical points gives rise to a whole…
Descriptive set theory is mainly concerned with studying subsets of the space of all countable binary sequences. In this paper we study the generalization where countable is replaced by uncountable. We explore properties of generalized…
We state a combinatorial optimization problem whose feasible solutions define both a decomposition and a node labeling of a given graph. This problem offers a common mathematical abstraction of seemingly unrelated computer vision tasks,…
In this paper, we introduce the comaximal graph $\Gamma(L)$ of a finite-dimensional Lie algebra $L$, whose vertices are the nontrivial proper Lie subalgebras of $L$ over a field $\mathbb{F}$, and two vertices $A$ and $B$ are adjacent if and…
Bilinear systems emerge in a wide variety of fields as natural models for dynamical systems ranging from robotics to quantum dots. Analyzing controllability of such systems is of fundamental and practical importance, for example, for the…
Graph neural networks (GNNs) have recently emerged as an effective approach to model neighborhood signals in collaborative filtering. Towards this research line, graph contrastive learning (GCL) demonstrates robust capabilities to address…
We introduce a combinatorial enumeration problem that is solved using generalized Catalan numbers. We also study generalizations of the Cycle Lemma beyond the computation of the generalized Catalan numbers.
Numerical simulations of coupled map lattices (CMLs) and other complex model systems show an enormous phenomenological variety that is difficult to classify and understand. It is therefore desirable to establish analytical tools for…
Shared randomness is a valuable resource in distributed computing, allowing some form of coordination between processors without explicit communication. But what happens when the shared random string can affect the inputs to the system?…