English
Related papers

Related papers: Logical Characterizations of Weighted Complexity C…

200 papers

We define tensor categories ${\sf Ver}_{p^n}(G)$ in characteristic $p$ for connected reductive groups $G$ and positive integers $n$, generalising the semisimple Verlinde categories ${\sf Ver}_p(G)$ originating from Gelfand-Kazhdan and the…

Representation Theory · Mathematics 2026-02-03 Joseph Newton

This paper has two parts. The main goal, carried out in Part I, is to survey some recent work by the authors in which "forced" grading constructions have played a significant role in the representation theory of semisimple algebraic groups…

Representation Theory · Mathematics 2016-03-28 Brian Parshall , Leonard Scott

We systematically investigate the complexity of model checking the existential positive fragment of first-order logic. In particular, for a set of existential positive sentences, we consider model checking where the sentence is restricted…

Logic in Computer Science · Computer Science 2015-03-20 Hubie Chen

A new notion of independence relation is given and associated to it, the class of flat theories, a subclass of strong stable theories including the superstable ones is introduced. More precisely, after introducing this independence…

Logic · Mathematics 2018-04-18 Daniel Palacín , Saharon Shelah

Supervised learning in a binary perceptron is able to classify an extensive number of random patterns by a proper assignment of binary synaptic weights. However, to find such assignments in practice, is quite a nontrivial task. The relation…

Disordered Systems and Neural Networks · Physics 2014-11-19 Haiping Huang , Yoshiyuki Kabashima

This paper studies the relationship between labelled and nested calculi for propositional intuitionistic logic, first-order intuitionistic logic with non-constant domains and first-order intuitionistic logic with constant domains. It is…

Logic · Mathematics 2021-04-20 Tim Lyon

Since the seminal work by Angluin and the introduction of the L*-algorithm, active learning of automata by membership and equivalence queries has been extensively studied to learn various extensions of automata. For weighted automata,…

Formal Languages and Automata Theory · Computer Science 2025-08-13 Laure Daviaud , Marianne Johnson

We discuss Poisson structures on a weighted polynomial algebra $A:=\Bbbk[x, y, z]$ defined by a homogeneous element $\Omega\in A$, called a potential. We start with classifying potentials $\Omega$ of degree deg$(x)+$deg$(y)+$deg$(z)$ with…

Rings and Algebras · Mathematics 2023-09-14 Hongdi Huang , Xin Tang , Xingting Wang , James J. Zhang

We derive atomic decompositions and frames for weighted Bergman spaces of several complex variables on the unit ball in the spirit of Coifman, Rochberg, and Luecking. In contrast to our predecessors, we use group theoretic methods, in…

Complex Variables · Mathematics 2015-04-03 Jens Christensen , Karlheinz Gröchenig , Gestur Ólafsson

Interpretability is an elusive but highly sought-after characteristic of modern machine learning methods. Recent work has focused on interpretability via $\textit{explanations}$, which justify individual model predictions. In this work, we…

Machine Learning · Computer Science 2019-10-31 David Alvarez-Melis , Hal Daumé , Jennifer Wortman Vaughan , Hanna Wallach

In this paper we demonstrate that the class of basic feasible functionals has recursion theoretic properties which naturally generalize the corresponding properties of the class of feasible functions. We also improve the Kapron - Cook…

Logic in Computer Science · Computer Science 2007-05-23 Aleksandar Ignjatovic , Arun Sharma

This paper connects the classes of weighted alternating finite automata (WAFA), weighted finite tree automata (WFTA), and polynomial automata (PA). First, we investigate the use of trees in the run semantics for weighted alternating…

Logic in Computer Science · Computer Science 2024-02-14 Gustav Grabolle

This paper investigates how global decision problems over arithmetically represented domains acquire reflective structure through class-quantification. Arithmetization forces diagonal fixed points whose verification requires reflection…

Computational Complexity · Computer Science 2025-11-19 Milan Rosko

In this paper we propose an algebraic formalization of connectors in the quantitative setting, in order to address their non-functional features in architectures of component-based systems. We firstly present a weighted Algebra of…

Logic in Computer Science · Computer Science 2022-09-22 Christina Chrysovalanti Fountoukidou , Maria Pittou

We prove a complexity dichotomy theorem for all non-negative weighted counting Constraint Satisfaction Problems (CSP). This caps a long series of important results on counting problems including unweighted and weighted graph homomorphisms…

Computational Complexity · Computer Science 2010-12-30 Jin-Yi Cai , Xi Chen , Pinyan Lu

We study graph products of groups from the viewpoint of measured group theory. We first establish a full measure equivalence classification of graph products of countably infinite groups over finite simple graphs with no transvection and no…

Group Theory · Mathematics 2024-01-10 Amandine Escalier , Camille Horbez

Fermionic extensions of generic 2d gravity theories obtained from the graded Poisson-Sigma model (gPSM) approach show a large degree of ambiguity. In addition, obstructions may reduce the allowed range of fields as given by the bosonic…

High Energy Physics - Theory · Physics 2009-11-07 L. Bergamin , W. Kummer

This is the first part of a series of four articles. In this work, we are interested in weighted norm estimates. We put the emphasis on two results of different nature: one is based on a good-$\lambda$ inequality with two-parameters and the…

Classical Analysis and ODEs · Mathematics 2018-10-10 Pascal Auscher , José Maria Martell

In this paper, we establish an innovative framework in logarithmic Hodge theory for toroidal varieties, introducing weighted toroidal structures and developing a systematic obstruction theory for Hodge classes. Building upon recent advances…

Algebraic Geometry · Mathematics 2025-09-30 Jiaming Luo

We show that representations of convolution algebras such as Lustzig's graded affine Hecke algebra or the quiver Hecke algebra and quiver Schur algebra in (affine) type A can be realised in terms of certain equivariant motivic sheaves…

Representation Theory · Mathematics 2021-11-16 Jens Niklas Eberhardt , Catharina Stroppel