Related papers: Logical Characterizations of Weighted Complexity C…
We construct a class of non-weight modules over the twisted $N=2$ superconformal algebra $\T$. Let $\mathfrak{h}=\C L_0\oplus\C G_0$ be the Cartan subalgebra of $\T$, and let $\mathfrak{t}=\C L_0$ be the Cartan subalgebra of even part…
Weight Space Learning (WSL), which frames neural network weights as a data modality, is an emerging field with potential for tasks like meta-learning or transfer learning. Particularly, Implicit Neural Representations (INRs) provide a…
We introduce a weighted propositional configuration logic over a product valuation monoid. Our logic is intended to serve as a specification language for software architectures with quantitative features such as the average of all…
For an $S^1$-framed modular operad $P$, we introduce its "Feynman compactification" denoted by $FP$ which is a modular operad. Let $\{\mathbb{M}^{\sf fr}(g,n)\}_{(g,n)}$ be the $S^1$-framed modular operad defined using moduli spaces of…
This paper considers discrete and continuous semigroups of (weighted) composition operators on the Fock space. For discrete semigroups consisting of powers of a single operator, the asymptotic behaviour of the semigroups is analysed. For…
Logics with team semantics provide alternative means for logical characterization of complexity classes. Both dependence and independence logic are known to capture non-deterministic polynomial time, and the frontiers of tractability in…
In the field of computational logic, two classes of finite automata are considered fundamental: deterministic and nondeterministic automata (DFAs and NFAs). In a more fine-grained approach three natural intermediate classes were introduced,…
We show that the parametrised topological complexity of Cohen, Farber and Weinberger gives an invariant of group epimorphisms. We extend various bounds for the topological complexity of groups to obtain bounds for the parametrised…
Reversible weighted automata are introduced and considered in a specific setting where the weights are taken from a nontrivial locally finite commutative ring such as a finite field. It is shown that the supports of series realised by such…
This paper is motivated by the question whether there exists a logic capturing polynomial time computation over unordered structures. We consider several algorithmic problems near the border of the known, logically defined complexity…
Building on foundations introduced in a previous paper, we give several p-adic analytic descriptions of the categories of etale Zp-local systems and etale Qp-local systems on an affinoid algebra over a finite extension of Qp (or more…
In this paper we study the complex symmetry in the several variable Fock space by using the techniques of weighted composition operators and semigroups. We characterize unbounded weighted composition operators that are (real) complex…
We establish a discrete weighted version of Calder\'{o}n-Zygmund decomposition from the perspective of dyadic grid in ergodic theory. Based on the decomposition, we study discrete $A_\infty$ weights. First, characterizations of the reverse…
Generalizing supertropical algebras, we present a "layered" structure, "sorted" by a semiring which permits varying ghost layers, and indicate how it is more amenable than the "standard" supertropical construction in factorizations of…
This paper establishes a rigorous functional analytic framework for weighted Weyl-Sonine fractional operators on semi-infinite intervals. While the classical Phillips functional calculus relies strictly on completely monotonic Bernstein…
We develop a theory of arithmetic characteristic classes of (fully decomposed) automorphic vector bundles equipped with an invariant hermitian metric. These characteristic classes have values in an arithmetic Chow ring constructed by means…
We present the finite first-order theory (FFOT) machine, which provides an atemporal description of computation. We then develop a concept of complexity for the FFOT machine, and prove that the class of problems decidable by a FFOT machine…
We study $\varepsilon$-stability in continuous logic. We first consider stability in a model, where we obtain a definability of types result with a better approximation than that in the literature. We also prove forking symmetry for…
It was realized early on that topologies can model constructive systems, as the open sets form a Heyting algebra. After the development of forcing, in the form of Boolean-valued models, it became clear that, just as over ZF any…
In the paper we define three new complexity classes for Turing Machine undecidable problems inspired by the famous Cook/Levin's NP-complete complexity class for intractable problems. These are U-complete (Universal complete), D-complete…