Related papers: An effective analysis of the Denjoy rank

We study deterministic constructions of graphs for which the unique completion of low rank matrices is generically possible regardless of the values of the entries. We relate the completability to the presence of some patterns (particular…

We initiate a systematic study of the perfection of affine group schemes of finite type over fields of positive characteristic. The main result intrinsically characterises and classifies the perfections of reductive groups, and obtains a…

This paper is the first in a series of papers developing a functional-analytic theory of vertex (operator) algebras and their representations. For an arbitrary Z-graded finitely-generated vertex algebra (V, Y, 1) satisfying the standard…

We consider the multi-view data completion problem, i.e., to complete a matrix $\mathbf{U}=[\mathbf{U}_1|\mathbf{U}_2]$ where the ranks of $\mathbf{U},\mathbf{U}_1$, and $\mathbf{U}_2$ are given. In particular, we investigate the…

We consider the factorization of a rectangular matrix $X $ into a positive linear combination of rank-one factors of the form $u v^\top$, where $u$ and $v$ belongs to certain sets $\mathcal{U}$ and $\mathcal{V}$, that may encode specific…

Catamorphisms are functions that are recursively defined on list and trees and, in general, on Algebraic Data Types (ADTs), and are often used to compute suitable abstractions of programs that manipulate ADTs. Examples of catamorphisms…

For the General Factor problem we are given an undirected graph $G$ and for each vertex $v\in V(G)$ a finite set $B_v$ of non-negative integers. The task is to decide if there is a subset $S\subseteq E(G)$ such that $deg_S(v)\in B_v$ for…

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

Various feature descriptions are being employed in logic programming languages and constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called features. The descriptions…

Given a graph $G=(V, E)$ and and a proper labeling $f$ from $V$ to $\{1, ..., n\}$, we define $B(f)$ as the maximum absolute difference between $f(u)$ and $f(v)$ where $(u,v)\in E$. The bandwidth of $G$ is the minimum $B(f)$ for all $f$.…

Consider a decision problem whose instance is a function. Its degree of undecidability, measured by the corresponding class of the arithmetic (or Kleene-Mostowski) hierarchy hierarchy, may depend on whether the instance is a partial…

In this article, we extend a well known result about real rank zero C* Algebras to higher real rank C* Algebras. The main technique used here is similar to the method in which we approximate continuous functions using projections. What we…

Given a property (graph class) $\Pi$, a graph $G$, and an integer $k$, the \emph{$\Pi$-completion} problem consists in deciding whether we can turn $G$ into a graph with the property $\Pi$ by adding at most $k$ edges to $G$. The…

A powerful statistical interpolating concept, which we call \emph{fully lifted} (fl), is introduced and presented while establishing a connection between bilinearly indexed random processes and their corresponding fully decoupled (linearly…

Determining the explicit forms and modularity for string functions and branching coefficients for Kac--Moody algebras after Kac, Peterson, and Wakimoto is a long-standing, yet wide-open, problem and recently a connection has been made…

Compound probabilistic context-free grammars (C-PCFGs) have recently established a new state of the art for unsupervised phrase-structure grammar induction. However, due to the high space and time complexities of chart-based representation…

Assume $G$ is a connected reductive algebraic group defined over $\bar{\mathbb{F}_p}$ such that $p$ is good prime for $G$. Furthermore we assume that $Z(G)$ is connected and $G/Z(G)$ is simple of classical type. Let $F$ be a Frobenius…

Complementation of B\"uchi automata, required for checking automata containment, is of major theoretical and practical interest in formal verification. We consider two recent approaches to complementation. The first is the rank-based…

Let $\mathscr{L}$ be a recursive language. Let $S(\mathscr{L})$ be the set of $\mathscr{L}$-structures with domain $\omega$. Let $\Phi : {}^\omega 2 \rightarrow S(\mathscr{L})$ be a $\Delta_1^1$ function with the property that for all $x,y…

Let $ H $ be a subgroup of a finite group $ G $. We say that $ H $ satisfies the partial $ \Pi $-property in $ G $ if there exists a $G$-chief series $ \varGamma_{G}: 1 =G_{0} < G_{1} < \cdot\cdot\cdot < G_{n}= G $ of $ G $ such that $ | G…