Related papers: A new criterion for integral modular categorificat…
We give an effective criterion for the identifiability of additive decompositions of homogeneous forms of degree $d$ in a fixed number of variables. Asymptotically for large $d$ it has the same order of the Kruskal's criterion adapted to…
We explicitly write down the Eisenstein elements inside the space of modular symbols for Eisenstein series with integer coefficients for the congruence subgroups $\Gamma_0(N)$ with $N$ odd square-free. We also compute the winding elements…
We classify all fusion categories for a given set of fusion rules with three simple object types. If a conjecture of Ostrik is true, our classification completes the classification of fusion categories with three simple object types. To…
A computable structure $\mathcal{A}$ has degree of categoricity $\mathbf{d}$ if $\mathbf{d}$ is exactly the degree of difficulty of computing isomorphisms between isomorphic computable copies of $\mathcal{A}$. Fokina, Kalimullin, and Miller…
Let $H$ be a generalized Liu algebra over an algebraically closed field $k$ of characteristic zero. We prove that all simple Yetter-Drinfeld modules over $H$ are finite-dimensional and present an explicit classification of these modules.…
We give a definition of monoidal categorifications of quantum cluster algebras and provide a criterion for a monoidal category of finite-dimensional graded $R$-modules to become a monoidal categorification of a quantum cluster algebra,…
For any length category, we establish a set of rules (necessary and sufficient) that ensure a partial order on the isomorphism classes of simple objects such that the category is equivalent to the category of finite dimensional…
We introduce the notion of a categorical valuative invariant of polyhedra or matroids, in which alternating sums of numerical invariants are replaced by split exact sequences in an additive category. We provide categorical lifts of a number…
In this paper we outline a PhD research plan. This research contributes to the field of one-class incremental learning and classification in case of non-stationary environments. The goal of this PhD is to define a new classification…
Over fields of characteristic zero, we determine all absolutely irreducible Yetter-Drinfeld modules over groups that have prime dimension and yield a finite-dimensional Nichols algebra. To achieve our goal, we introduce orders of braided…
The clustering of categorical data is a common and important task in computer science, offering profound implications across a spectrum of applications. Unlike purely numerical data, categorical data often lack inherent ordering as in…
We study finitely generated models of countable theories, having at most countably many nonisomorphic finitely generated models. We intro- duce a notion of rank of finitely generated models and we prove, when T has at most countably many…
We present several infinite families of potential modular data motivated by examples of Drinfeld centers of quadratic categories. In each case, the input is a pair of involutive metric groups with Gauss sums differing by a sign, along with…
Inverse classification is the process of perturbing an instance in a meaningful way such that it is more likely to conform to a specific class. Historical methods that address such a problem are often framed to leverage only a single…
We investigate non-semisimple modular categories with an eye towards a structure theory, low-rank classification, and applications to low dimensional topology and topological physics. We aim to extend the well-understood theory of…
We introduce the notions of categorical integrals and categorical cointegrals of a finite tensor category $\mathcal{C}$ by using a certain adjunction between $\mathcal{C}$ and its Drinfeld center $\mathcal{Z}(\mathcal{C})$. These notions…
In this paper, we first present a classification theorem of infinite-dimensional simple Novikov algebras over an algebraically closed field with characteristic 0. Then we classify all the irreducible modules of a certain…
In the algorithm Intersort, Chevalley et al. (2024) proposed a score-based method to discover the causal order of variables in a Directed Acyclic Graph (DAG) model, leveraging interventional data to outperform existing methods. However, as…
Let $\Lambda$ be a $\mathbb{Z}$-graded artin algebra. Two classical results of Gordon and Green state that if $\Lambda$ has only finitely many indecomposable gradable modules, up to isomorphism, then $\Lambda$ has finite representation…
Second-order superintegrable systems in dimensions two and three are essentially classified. With increasing dimension, however, the non-linear partial differential equations employed in current methods become unmanageable. Here we propose…