Related papers: Generalized Hex and logical characterizations of p…
In \cite{gmw2022}, Guan, Murugan and Wei established the equivalence of the classical Helmholtz equation with a ``fractional Helmholtz" equation in which the Laplacian operator is replaced by the nonlocal fractional Laplacian operator. More…
We answer the natural question: when are a regular Poisson structure along with a complex structure transverse to its symplectic leaves induced by generalized complex structure? The leafwise symplectic form and transverse complex structure…
Here we obtain bounds on the spectrum of that operator whose inverse, when it exists, gives the Green's function. We consider the wide of physical problems that can be cast in a form where a constitutive equation ${\bf J}({\bf x})={\bf…
We propose an unbounded fully homomorphic encryption scheme, i.e. a scheme that allows one to compute on encrypted data for any desired functions without needing to decrypt the data or knowing the decryption keys. This is a rational…
We consider a nonlocal functional equation that is a generalization of the mathematical model used in behavioral sciences. The equation is built upon an operator that introduces a convex combination and a nonlinear mixing of the function…
The generalised Hopf equation is the first order nonlinear equation with data $\Phi$ a holomorphic functions and $\eta\geq 1$ a positive weight, \[ h_w\,\overline{h_\wbar}\,\eta(w) = \Phi.\] The Hopf equation is the special case…
The Goldberg-Ostrovskii problem asks whether finite-order solutions of a linear differential equation inherit the property of completely regular growth (c.r.g.) from its coefficients. While Bergweiler's counterexample demonstrated that the…
We propose a generalization of first-order logic originating in a neglected work by C.C. Chang: a natural and generic correspondence language for any types of structures which can be recast as Set-coalgebras. We discuss axiomatization and…
This paper presents regularity results and associated high-order numerical methods for one-dimensional Fractional-Laplacian boundary-value problems. On the basis of a factorization of solutions as a product of a certain edge-singular weight…
This thesis describes the theoretical and practical foundations of a system for the static analysis of XML processing languages. The system relies on a fixpoint temporal logic with converse, derived from the mu-calculus, where models are…
A standard assumption in the study of logarithmic structures is "fineness", but this assumption is not preserved by intersections, fiber products, and more general limits. We explain how a coherent logarithmic scheme $X$ has a natural…
The uniform one-dimensional fragment of first-order logic was introduced a few years ago as a generalization of the two-variable fragment of first-order logic to contexts involving relations of arity greater than two. Quantifiers in this…
Uniform preorders are a class of combinatory representations of Set-indexed preorders that generalize Pieter Hofstra's basic relational objects. An indexed preorder is representable by a uniform preorder if and only if it has as generic…
We establish a purely geometric form of the concentration theorem (also called localization theorem) for actions of a linearly reductive group $G$ on an affine scheme $X$ over an affine base scheme $S$. It asserts the existence of a…
The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIME-complete in the presence of unrestricted axioms. Several fragments of ALC, notably logics in the FL, EL, and…
We begin with the observation that the signed generalized Stirling polynomials $P_k(m,x)$, which occur in a generalization of Malmsten's integral, reduce to the falling factorials when $k=m$. The structure of these generalized Stirling…
We study generalized complex manifolds from the point of view of symplectic and Poisson geometry. We start by showing that every generalized complex manifold admits a canonical Poisson structure. We use this fact, together with Weinstein's…
Over the past two decades several fragments of first-order logic have been identified and shown to have good computational and algorithmic properties, to a great extent as a result of appropriately describing the image of the standard…
We first show that infinite satisfiability can be reduced to finite satisfiability for all prenex formulas of Separation Logic with $k\geq1$ selector fields ($\seplogk{k}$). Second, we show that this entails the decidability of the finite…
Let $\mathbb{G}$ be a higher-rank connected semisimple Lie group with finite center and without compact factors. In any unitary representation $(\pi, \mathcal{H})$ of $\mathbb{G}$ without non-trivial $\mathbb{G}$-fixed vectors, we study the…