English
Related papers

Related papers: Weak length induction and slow growing depth boole…

200 papers

In this paper, we study representations of the vertex operator algebra $L(k,0)$ at one-third admissible levels $k= -5/3, -4/3, -2/3$ for the affine algebra of type $G_2^{(1)}$. We first determine singular vectors and then obtain a…

Representation Theory · Mathematics 2010-11-16 Jonathan D. Axtell , Kyu-Hwan Lee

An arbitrary-depth reduction theorem for the `convolution' multiple L-values of Euler-Zagier type is proven by an analytic method. To this end, generalized polylogarithms associated to Dirichlet characters are defined. The proof uses the…

Number Theory · Mathematics 2007-05-23 David Terhune

We provide quantitative weighted weak type estimates for non-integral square functions in the critical case $p=2$ in terms of the $A_p$ and reverse H\"older constants associated to the weight. The method of proof uses a decoupling of the…

Classical Analysis and ODEs · Mathematics 2025-06-19 Dario Mena , Maria Carmen Reguera , Luz Roncal

We prove that the problem of deciding the consequence relation of the full Lambek calculus with weakening is complete for the class HAck of hyper-Ackermannian problems (i.e., level F_{\omega}^{\omega} of the ordinal-indexed hierarchy of…

Logic in Computer Science · Computer Science 2024-06-25 Vitor Greati , Revantha Ramanayake

The paper is devoted to the convex-set counterpart of the theory of weak$^*$ derived sets initiated by Banach and Mazurkiewicz for subspaces. The main result is the following: For every nonreflexive Banach space $X$ and every countable…

Functional Analysis · Mathematics 2021-12-14 Mikhail I. Ostrovskii

It is known that rational approximations of elementary analytic functions (exp, log, trigonometric, and hyperbolic functions, and their inverse functions) are computable in the weak complexity class $\mathrm{TC}^0$. We show how to formalize…

Logic in Computer Science · Computer Science 2023-04-03 Emil Jeřábek

This is a survey of weak approximation over complex function fields, touching on the Koll'ar-Miyaoka-Mori theorem, places of good and bad reduction, the special case of rational surfaces, rationally simply connected varieties, and…

Algebraic Geometry · Mathematics 2010-08-17 Brendan Hassett

We use De Giorgi-Nash-Moser iteration scheme to establish that weak solutions to a coupled system of elliptic equations with critical growth on the boundary are in $L^\infty(\Omega)$. Moreover, we provide an explicit $L^\infty(\Omega)$-…

Analysis of PDEs · Mathematics 2025-04-18 Maya Chhetri , Nsoki Mavinga , Rosa Pardo

If $\lambda <\kappa$ are infinite cardinals, a linear order $L$ is isomorphic to a maximal chain in $[\kappa ]^{\kappa |\kappa }$ (resp. $[\kappa ]^{\lambda |\kappa }$; $[\kappa ]^{\kappa |\lambda }$) iff $L$ is weakly Boolean, the weight…

Logic · Mathematics 2024-12-31 Miloš Kurilić , Boriša Kuzeljević

A linear different operator L is called weakly hypoelliptic if any local solution u of Lu=0 is smooth. We allow for systems, that is, the coefficients may be matrices, not necessarily of square size. This is a huge class of important…

Analysis of PDEs · Mathematics 2013-08-02 Christian Baer

Recently, Forbes, Kumar and Saptharishi [CCC, 2016] proved that there exists an explicit $d^{O(1)}$-variate and degree $d$ polynomial $P_{d}\in VNP$ such that if any depth four circuit $C$ of bounded formal degree $d$ which computes a…

Computational Complexity · Computer Science 2021-07-22 Suryajith Chillara

We prove that an idempotent operation generates a loop from a strongly connected digraph containing directed cycles of all lengths under very mild (local) algebraic assumptions. Using the result, we reprove the existence of a weakest…

Logic · Mathematics 2019-02-26 Miroslav Olšák

We investigate weakly constrained codes, in which specific patterns occur with prescribed frequencies rather than being strictly forbidden as in conventional constrained coding. We propose a capacity-achieving construction of a weakly…

Information Theory · Computer Science 2026-05-22 Prachi Mishra , Sidharth Jaggi , Navin Kashyap , Michael Langberg

We present here a novel approach to evaluation of the weak localization correction (WLC) to transport properties of a mesoscopic conductor. It is based on an extension of Keldysh technique and allows one to evaluate the full counting…

Mesoscale and Nanoscale Physics · Physics 2009-09-25 Yuli V. Nazarov

We prove the first Fixed-depth Size-hierarchy Theorem for uniform AC$^0[\oplus]$ circuits; in particular, for fixed $d$, the class $\mathcal{C}_{d,k}$ of uniform AC$^0[\oplus]$ formulas of depth $d$ and size $n^k$ form an infinite…

Computational Complexity · Computer Science 2019-02-21 Nutan Limaye , Karteek Sreenivasaiah , Srikanth Srinivasan , Utkarsh Tripathi , S. Venkitesh

We extend the Larson-Sweedler theorem to weak Hopf algebras by proving that a finite dimensional weak bialgebra is a weak Hopf algebra iff it possesses a non-degenerate left integral. We show that the category of modules over a weak Hopf…

Quantum Algebra · Mathematics 2007-05-23 P. Vecsernyes

Warped conformal field theories in two dimensions are exotic nonlocal, Lorentz violating field theories characterized by Virasoro-Kac-Moody symmetries and have attracted a lot of attention as candidate boundary duals to warped AdS$_3$…

High Energy Physics - Theory · Physics 2023-01-19 Arpan Bhattacharyya , Gaurav Katoch , Shubho R. Roy

We present a semiclassical analysis of the quantum propagator of a particle confined on one side by a steeply, monotonically rising potential. The models studied in detail have potentials proportional to $x^{\alpha}$ for $x>0$; the limit…

Mathematical Physics · Physics 2013-06-05 F. D. Mera , S. A. Fulling , J. D. Bouas , K. Thapa

We construct an internal language for cartesian closed bicategories. Precisely, we introduce a type theory modelling the structure of a cartesian closed bicategory and show that its syntactic model satisfies an appropriate universal…

Logic in Computer Science · Computer Science 2019-04-16 Marcelo Fiore , Philip Saville

We study the complexity of inverse cellular automata on configurations of bounded size. Deciding injectivity in this setting is co-NP-complete by a theorem of Durand. We give a simpler proof of this theorem by a direct reduction from UNSAT…

Logic · Mathematics 2026-04-02 Maryia Kapytka
‹ Prev 1 8 9 10 Next ›