Related papers: Relative Constructibility via Generalised Sequenti…
Generalized Cluster Algebras (GCA) are generalizations of Cluster Algebras (CA) with higher-order exchange relations. Previously, Chekhov-Shapiro conjectured that every GCA can be embedded into a CA. In this paper, we prove a modified…
We develop a correspondence between the theory of sequential algorithms and classical reasoning, via Kreisel's no-counterexample interpretation. Our framework views realizers of the no-counterexample interpretation as dynamic processes…
We introduce an alternative to the notion of `fast rate' in Learning Theory, which coincides with the optimal error rate when the given class happens to be convex and regular in some sense. While it is well known that such a rate cannot…
In this paper, we investigate connections between structures present in every generic extension of the universe $V$ and computability theory. We introduce the notion of {\em generic Muchnik reducibility} that can be used to to compare the…
Rule-based reasoning is an essential part of human intelligence prominently formalized in artificial intelligence research via logic programs. Describing complex objects as the composition of elementary ones is a common strategy in computer…
Suppose $p \geq 1$ is a computable real. We extend previous work of Clanin, Stull, and McNicholl by classifying the computable $L^p$ spaces whose underlying measure spaces are atomic but not purely atomic. In addition, we determine the…
Constructive type theory combines logic and programming in one language. This is useful both for reasoning about programs written in type theory, as well as for reasoning about other programming languages inside type theory. It is…
In this paper we propose a construction of generic character sheaves on reductive groups over finite local rings at even levels, whose characteristic functions are higher Deligne--Lusztig characters when the parameters are generic. We…
We prove global convergence of classical projection algorithms for feasibility problems involving union convex sets, which refer to sets expressible as the union of a finite number of closed convex sets. We present a unified strategy for…
This work is meant to be a step towards the formal definition of the notion of algorithm, in the sense of an equivalence class of programs working "in a similar way". But instead of defining equivalence transformations directly on programs,…
We consider the models of distributed computation defined as subsets of the runs of the iterated immediate snapshot model. Given a task $T$ and a model $M$, we provide topological conditions for $T$ to be solvable in $M$. When applied to…
In this paper we prove the conjecture of Lusztig in "Generic character sheaves on groups over $\mathbf{k}[\epsilon]/(\epsilon^r)$." Given a reductive group over $\mathbb{F}_q$ for some $r\geq 2$, there is a notion of a character sheaf…
It is known that a generalized $q$-Schur algebra may be constructed as a quotient of a quantized enveloping algebra $\UU$ or its modified form $\dot{\UU}$. On the other hand, we show here that both $\UU$ and $\dot{\UU}$ may be constructed…
A coreset is a small set that can approximately preserve the structure of the original input data set. Therefore we can run our algorithm on a coreset so as to reduce the total computational complexity. Conventional coreset techniques…
A constructive method for decomposing finite dimensional representations of semisimple real Lie algebras is developed. The method is illustrated by an example. We also discuss an implementation of the algorithm in the language of the…
In recent years, Answer Set Programming (ASP), logic programming under the stable model or answer set semantics, has seen several extensions by generalizing the notion of an atom in these programs: be it aggregate atoms, HEX atoms,…
Let $K$ be a reductive subgroup of a reductive group $G$ over an algebraically closed field $k$. The notion of relative complete reducibility, introduced in previous work of Bate-Martin-Roehrle-Tange, gives a purely algebraic description of…
We propose a notion of a generalized order, which can be used for the notion of a strict partial order. We introduce a weak order to replace the usual weak order defined from a strict partial order. In a constructive setting, that usual…
Compositional generalization is a fundamental trait in humans, allowing us to effortlessly combine known phrases to form novel sentences. Recent works have claimed that standard seq-to-seq models severely lack the ability to compositionally…
The generalized quadratic assignment problem (GQAP) is one of the hardest problems to solve in the operations research area. The GQAP addressed in this work is defined as the task of minimizing the assignment and transportation costs of…