相关论文: A Note on Induction Schemas in Bounded Arithmetic

A key result in a 2004 paper by S. Arkhipov, R. Bezrukavnikov, and V. Ginzburg compares the bounded derived category of modules for the principal block of a Lusztig quantum enveloping algebra at anroot of unity with an explicit subcategory…

The notion of bounded element of C*-inductive locally convex spaces (or C*-inductive partial *-algebras) is introduced and discussed in two ways: the first one takes into account the inductive structure provided by certain families of…

We analyze the supersymmetric defect indices of $\mathcal{N}=4$ super Yang Mills theories which are simultaneously decorated by the BPS line operators and the boundary conditions. We demonstrate that the two-point functions of the boundary…

For a limited range of indices $p$, we obtain $L^p(\mathbb{R}^n)$ boundedness for singular integral operators whose kernels satisfy a condition weaker than the typical H\"ormander smoothness estimate. These operators are assumed to be…

In the pure Calculus of Constructions (CC) one can define data types and function over these, and there is a powerful higher order logic to reason over these functions and data types. This is due to the combination of impredicativity and…

We construct dual descriptions of (0,2) gauged linear sigma models. In some cases, the dual is a (0,2) Landau-Ginzburg theory, while in other cases, it is a non-linear sigma model. The duality map defines an analogue of mirror symmetry for…

Cha and Kim proved that if a knot K is not algebraically slice, then no iterated Bing double of K is concordant to the unlink. We prove that if K has nontrivial signature $\sigma$, then the n-iterated Bing double of K is not concordant to…

Let $S$ be a subset of $\{1,\ldots,N\}$ avoiding the nontrivial progressions $x, x+y^2-1, x+ 2(y^2-1)$. We prove that $|S|\ll N/\log_m{N}$, where $\log_m $ is the $m$-fold iterated logarithm and $m\in\mathbf{N}$ is an absolute constant.…

One measure of the complexity of a first-order theory, and similarly a type, is the complexity of the formulas required to axiomatize it. We say a theory is bounded if there is an axiomatization involving only $\forall_n$-formulas for some…

Let $\beta:=\sigma_1\sigma_2^{-1}$ be a braid in $B_3$, where $B_3$ is the braid group on 3 strings and $\sigma_1, \sigma_2$ are the standard Artin generators. We use Gauss diagram formulas to show that for each natural number $n$ not…

Full Intuitionistic Linear Logic (FILL) is multiplicative intuitionistic linear logic extended with par. Its proof theory has been notoriously difficult to get right, and existing sequent calculi all involve inference rules with complex…

It was shown by the second author in (CPAA, 2019) for the biharmonic Schr\"odinger equation and most recently by Himonas and Mantzavinos (Nonlinearity, 2020) for 2D Schr\"odinger equation that Fokas method based formulas are capable of…

Lately, to provide a solid ground for quantization of the open string theory with a constant B-field, it has been proposed to treat the boundary conditions as hamiltonian constraints. It seems that this proposal is quite general and should…

We detect an inclusion with infinite conductivity from boundary measurements represented by the Dirichlet-to-Neumann map for the conductivity equation. We use both the enclosure method and the probe method. We use the enclosure method to…

We bound integral means of the Bergman projection of a function in terms of integral means of the original function. As an application of these results, we bound certain weighted Bergman space norms of derivatives of Bergman projections in…

This paper brings together two lines of research: implicit characterization of complexity classes by Linear Logic (LL) on the one hand, and computation over an arbitrary ring in the Blum-Shub-Smale (BSS) model on the other. Given a fixed…

The first-order theory of a string automatic structure is known to be decidable, but there are examples of string automatic structures with nonelementary first-order theories. We prove that the first-order theory of a string automatic…

We study the pigeonhole principle for $\Sigma_2$-definable injections with domain twice as large as the codomain, and the weak K\"onig lemma for $\Delta^0_2$-definable trees in which every level has at least half of the possible nodes. We…

In this article, we extend the integration by parts formulae for the laws of Bessel bridges obtained in previous work with Zambotti, by showing that these formulae hold for very general test functionals on $L^{2}(0,1)$. A key step consists…

Denote by $\lambda(n)$ Liouville's function concerning the parity of the number of prime divisors of $n$. Using a theorem of Allouche, Mend\`es France, and Peyri\`ere and many classical results from the theory of the distribution of prime…