Related papers: Le symbole de Hasse logarithmique

Linear forms in logarithms have an important role in the theory of Diophantine equations. In this article, we prove explicit $p$-adic lower bounds for linear forms in $p$-adic logarithms of rational numbers using Pad\'e approximations of…

In this paper, we develop the theory of the necklace ring and the logarithmic function. Regarding the necklace ring, we introduce the necklace ring functor $Nr$ from the category of special $\ld$-rings into the category of special…

Consider the ideal I corresponding to r points in P^2. We study the symbolic generic initial system of I, formed by taking the generic initial ideals of the symbolic powers of I, and its asymptotic behaviour. In particular, we describe the…

In this paper, we got some refinements of the norm inequalities related to the Heinz mean and logarithmic mean.

We report on the mechanization of (preference-based) conditional normative reasoning. Our focus is on Aqvist's system E for conditional obligation, and its extensions. Our mechanization is achieved via a shallow semantical embedding in…

We establish an asymptotic formula for the logarithmic mean value of a 1-bounded multiplicative function that is sharp in many cases of interest. We derive from it a variety of applications, making progress on several old problems. As a…

We observe that the line bundle associated to the tame symbol of two invertible holomorphic functions also carries a fairly canonical hermitian metric, hence it represents a class in a Hermitian holomorphic Deligne cohomology group. We put…

The complete optimal systems of subalgebras of all nonisomorphic three- and four-dimensional real Lie algebras are analyzed by the program \symbolie running in the computer algebra system \emph{Wolfram Mathematica}\texttrademark. The…

We prove an algebraic canonicity theorem for normal LE-logics of arbitrary signature, in a generalized setting in which the non-lattice connectives are interpreted as operations mapping tuples of elements of the given lattice to closed or…

We provide a new characterization of the logarithmic Sobolev inequality.

If the Hasse invariant of a $p$-divisible group is small enough, then one can construct a canonical subgroup inside its $p$-torsion. We remark that, assuming the existence of a subgroup of adequate height in the $p$-torsion whose dual has…

These course notes are about computing modular forms and some of their arithmetic properties. Their aim is to explain and prove the modular symbols algorithm in as elementary and as explicit terms as possible, and to enable the devoted…

In this work we develop a theory of motives for logarithmic schemes over fields in the sense of Fontaine, Illusie, and Kato. Our construction is based on the notion of finite log correspondences, the dividing Nisnevich topology on log…

We show that the residue density of the logarithm of a generalised Laplacian on a closed manifold defines an invariant polynomial valued differential form. We express it in terms of a finite sum of residues of classical pseudodifferential…

Neurosymbolic AI focuses on integrating learning and reasoning, in particular, on unifying logical and neural representations. Despite the existence of an alphabet soup of neurosymbolic AI systems, the field is lacking a generally accepted…

Employing Br\"udern's and Wooley's new complification method, we establish an asymptotic Hasse principle for the number of solutions to a system of r_3 cubic and r_2 quadratic diagonal forms, when the number of cubic equations is at least…

We give a geometric proof that Hasse principle holds for the following varieties defined over global function fields: smooth quadric hypersurfaces in odd characteristic, smooth cubic hypersurfaces of dimension at least $4$ in characteristic…

We show how to express any Hasse-Schmidt derivation of an algebra in terms of a finite number of them under natural hypothesis. As an application, we obtain coefficient fields of the completion of a regular local ring of positive…

Many interesting and useful symbolic computation algorithms manipulate mathematical expressions in mathematically meaningful ways. Although these algorithms are commonplace in computer algebra systems, they can be surprisingly difficult to…

We shall introduce the principal symbol for Euler-Lagrange operators and use them to charac- terise well-posed initial value problems. We shall clarify how constraints can arise in Lagrangian covariant theories by extending the standard…