Related papers: Traversal-invariant characterizations of logarithm…
In this paper we introduce the concepts of higher equivariant and invariant topological complexity; and study their properties. Then we compare them with equivariant LS-category. We give lower and upper bounds for these new invariants. We…
We study function spaces that are related to square-integrable, irreducible, unitary representations of several low-dimensional nilpotent Lie groups. These are new examples of coorbit theory and yield new families of function spaces on…
Linear temporal logic (LTL) is a specification language for finite sequences (called traces) widely used in program verification, motion planning in robotics, process mining, and many other areas. We consider the problem of learning LTL…
In this paper we discuss function spaces on a general noncompact Lie group, namely the scales of Triebel--Lizorkin and Besov spaces, defined in terms of a sub-Laplacian with drift. The sub-Laplacian is written as negative the sum of squares…
We establish general versions of a variety of results for quasiconvex, lower-semicontinuous, and law-invariant functionals. Our results extend well-known results from the literature to a large class of spaces of random variables. We…
Using the momentum constraint, the standard evolution system is written in a fully first order form. The class of first order invariant algebraic slicing conditions is considered. The full set of characteristic fields is explicitly given.…
We propose a novel framework seamlessly providing key properties of both neural nets (learning) and symbolic logic (knowledge and reasoning). Every neuron has a meaning as a component of a formula in a weighted real-valued logic, yielding a…
We introduce some notions of invariant elementary definability which extend the notions of first-order order-invariant definability, and, more generally, definability invariant with respect to arbitrary numerical relations. In particular,…
We present an extension to the $\mathtt{mathlib}$ library of the Lean theorem prover formalizing the foundations of computability theory. We use primitive recursive functions and partial recursive functions as the main objects of study, and…
Logarithmic representations of the bordism category are considered as a framework for capturing a class of additive invariants characterising Reidemeister torsions.
In this paper, we introduce and share the new concept of $\mathcal{MT}(\lambda )$-functions and its some characterizations.
In program semantics and verification, reasoning about loops is complicated by the need to produce two separate mathematical arguments: an invariant, for functional properties (ignoring termination); and a variant, for termination (ignoring…
Building on recent results regarding symmetric probabilistic constructions of countable structures, we provide a method for constructing probability measures, concentrated on certain classes of countably infinite structures, that are…
Logarithmic conformal field theories have a vast range of applications, from critical percolation to systems with quenched disorder. In this paper we thoroughly examine the structure of these theories based on their symmetry properties. Our…
$O(N)$ invariants are the observables of real tensor models. We use regular colored graphs to represent these invariants, the valence of the vertices of the graphs relates to the tensor rank. We enumerate $O(N)$ invariants as $d$-regular…
In this paper we give algebraic characterizations of the affine $2$-space and the affine $3$-space over an algebraically closed field of characteristic zero, using a variant of the Makar-Limanov invariant.
For any Legendrian link in $\displaystyle \mathbb{R}^{3}$ given by the rainbow closure of a positive braid word, we develop an explicit and computable description of a Legendrian isotopy invariant associated with it, namely the…
We explore a new form of DFT, which we call the Polynomial Transform. It functions over finite fields, and a size $n$ transform takes $O(n)$ operations. In the multitape Turing machine model, it allows us to multiply two $n$ bit numbers in…
We propose to extend ``invertibility'' to ``regularity'' for categories in general abstract algebraic manner. Higher regularity conditions and ``semicommutative'' diagrams are introduced. Distinction between commutative and…
We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic L, which is defined from L in a similar way as the…