Related papers: Hierarchical formula classes with respect to semi-…
We introduce a generalization of the Euclidean algorithm for rings equipped with an involution, and completely enumerate all isomorphism classes of orders over definite, rational quaternion algebras equipped with an orthogonal involution…
We consider a large family of equivalence relations on permutations in Sn that generalise those discovered by Knuth in his study of the Robinson-Schensted correspondence. In our most general setting, two permutations are equivalent if one…
A conjecture predicting an injective and surjective mapping $X = \displaystyle\frac{\sigma(p^k)}{p^k}, Y = \displaystyle\frac{\sigma(m^2)}{m^2}$ between OPNs $N = {p^k}{m^2}$ (with Euler factor $p^k$) and rational points on the hyperbolic…
We introduce a modified affine Hecke algebra $\h{H}^{+}_{q\eta}({l})$ ($\h{H}_{q\eta}({l})$) which depends on two deformation parameters $q$ and $\eta$. When the parameter $\eta$ is equal to zero the algebra $\h{H}_{q\eta=0}(l)$ coincides…
In this paper, we propose a first second-order scheme based on arbitrary non-Euclidean norms, incorporated by Bregman distances. They are introduced directly in the Newton iterate with regularization parameter proportional to the square…
The results of the renormalization group are commonly advertised as the existence of power law singularities near critical points. The classic predictions are often violated and logarithmic and exponential corrections are treated on a…
For relatively prime positive integers $u_0$ and $r$ and for $0\le k\le n$, define $u_k:=u_0+kr$. Let $L_n:={\rm lcm}(u_0, u_1, ..., u_n)$ and let $a, l\ge 2$ be any integers. In this paper, we show that, for integers $\alpha \geq a$ and…
Deciding formulas mixing arithmetic and uninterpreted predicates is of practical interest, notably for applications in verification. Some decision procedures consist in building by structural induction an automaton that recognizes the set…
The generalized hyperharmonic numbers $h_n^{(m)}(k)$ are defined by means of the multiple harmonic numbers. We show that the hyperharmonic numbers $h_n^{(m)}(k)$ satisfy certain recurrence relation which allow us to write them in terms of…
Higher Type Arithmetic (HA$^w$) is a first-order many-sorted theory. It is a conservative extension of Heyting Arithmetic obtained by extending the syntax of terms to all of System T: the objects of interest here are the functionals of…
We study the expressive power of fragments of inclusion and independence logic defined by restricting the number k of universal quantifiers in formulas. Assuming the so-called strict semantics for these logics, we relate these fragments of…
We develop algebraic models of simple type theories, laying out a framework that extends universal algebra to incorporate both algebraic sorting and variable binding. Examples of simple type theories include the unityped and simply-typed…
If the $n-th$ order differential equation is not exact, under certain conditions, an integrating factor exists which transforms the differential equation into an exact one. Hence, its order can be reduced to the lower order. In this paper,…
Using the renormalization group approach, we consider the $O(N)\otimes O(M)$ model in four and more dimensions. We find that independently on $N$ and $M$, for $N\geq M\geq 2$, a transition can be of both the first and second order. In…
In the framework of the generalized Hamiltonian formalism by Dirac, the local symmetries of dynamical systems with first- and second-class constraints are investigated. For theories with an algebra of constraints of special form (to which a…
The first known $q$-analogues for any of the $17$ formulas for $\frac{1}{\pi}$ due to Ramanujan were introduced in 2018 by Guo and Liu (J. Difference Equ. Appl. 29:505-513, 2018), via the $q$-Wilf-Zeilberger method. Through a…
We introduce the notion of nonuniform coercion, which is the promotion of a value of one type to an enriched value of a different type via a nonuniform procedure. Nonuniform coercions are a generalization of the (uniform) coercions known in…
Exponential integrators are special time discretization methods where the traditional linear system solves used by implicit schemes are replaced with computing the action of matrix exponential-like functions on a vector. A very general…
Most parameterized complexity classes are defined in terms of a parameterized version of the Boolean satisfiability problem (the so-called weighted satisfiability problem). For example, Downey and Fellow's W-hierarchy is of this form. But…
Mathematical induction is a fundamental tool in computer science and mathematics. Henkin initiated the study of formalization of mathematical induction restricted to the setting when the base case B is set to singleton set containing 0 and…