Related papers: Logical Characterizations of Weighted Complexity C…
In this paper we develop a Fefferman-Stein theorem, a Hardy-Littlewood theorem and sharp function estimations in weighted Sobolev spaces. We also provide uniqueness and existence results for second-order elliptic and parabolic partial…
Deep learning, despite its remarkable achievements, is still a young field. Like the early stages of many scientific disciplines, it is marked by the discovery of new phenomena, ad-hoc design decisions, and the lack of a uniform and…
Let $\mathcal M=(M,<,...)$ be a linearly ordered first-order structure and $T$ its complete theory. We investigate conditions for $T$ that could guarantee that $\mathcal M$ is not much more complex than some colored orders (linear orders…
It was recently shown by van den Broeck at al. that the symmetric weighted first-order model counting problem (WFOMC) for sentences of two-variable logic FO2 is in polynomial time, while it is Sharp-P_1 complete for some FO3-sentences. We…
We provide a uniform construction of "mixed versions" or "graded lifts" in the sense of Beilinson-Ginzburg-Soergel which works for arbitrary Artin stacks. In particular, we obtain a general construction of graded lifts of many categories…
Algebraic theories with dependency between sorts form the structural core of Martin-L\"of type theory and similar systems. Their denotational semantics are typically studied using categorical techniques; many different categorical…
We study implicational formulas in the context of proof complexity of intuitionistic propositional logic (IPC). On the one hand, we give an efficient transformation of tautologies to implicational tautologies that preserves the lengths of…
We present a categorical theory of the composition methods in finite model theory -- a key technique enabling modular reasoning about complex structures by building them out of simpler components. The crucial results required by the…
Order-invariant formulas access an ordering on a structure's universe, but the model relation is independent of the used ordering. Order invariance is frequently used for logic-based approaches in computer science. Order-invariant formulas…
Notable results on the special values of $L$-functions of Siegel modular forms were obtained by J. Sturm in the case when the degree $n$ is even and the weight $k$ is an integer. In this paper we extend this method to half-integer weights…
We investigate the complexity of explicit construction problems, where the goal is to produce a particular object of size $n$ possessing some pseudorandom property in time polynomial in $n$. We give overwhelming evidence that $\bf{APEPP}$,…
In this paper, we show how a construction of an implicit complexity model can be implemented using concepts coming from the core of von Neumann algebras. Namely, our aim is to gain an understanding of classical computation in terms of the…
Our goal is to show that the standard model-theoretic concept of types can be applied in the study of order-invariant properties, i.e., properties definable in a logic in the presence of an auxiliary order relation, but not actually…
The weight space of the Ising perceptron in which a set of random patterns is stored is examined using the generating function of the partition function $\phi(n)=(1/N)\log [Z^n]$ as the dimension of the weight vector $N$ tends to infinity,…
We study the complex symmetric structure of weighted composition--differentiation operators of order $n $ on the weighted Bergman spaces $A_{\alpha}^2$ with respect to some conjugations. Then we provide some examples of these operators.
Affine Lie algebras admit non-classical highest-weight theories through alternative partitions of the root system. Although significant inroads have been made, much of the classical machinery is inapplicable in this broader context, and…
We investigate the intersection problem for finite semigroups, which asks for a given set of regular languages, represented by recognizing morphisms to finite semigroups, whether there exists a word contained in their intersection. We…
We establish a fundamental theorem of orders (FTO) which allows us to express all orders uniquely as an intersection of `irreducible orders' along which the index and the conductor distributes multiplicatively. We define a subclass of…
Amalgamation SNP (ASNP) is a fragment of existential second-order logic that strictly contains binary connected MMSNP of Feder and Vardi and binary guarded monotone SNP of Bienvenu, ten Cate, Lutz, and Wolter; it is a promising candidate…
We characterize strong continuity of general operator semigroups on some Lebesgue spaces. In particular, a characterization of strong continuity of weighted composition semigroups on classical Hardy spaces and weighted Bergman spaces with…