Related papers: An Additive Decomposition in S-Primitive Towers
Structural resolution (or S-resolution) is a newly proposed alternative to SLD-resolution that allows a systematic separation of derivations into term-matching and unification steps. Productive logic programs are those for which…
We introduce 'project-connex' tree-width as a measure of tractability for counting and aggregate conjunctive queries over semirings with 'group-by' projection (also known as 'AJAR' or 'FAQ' queries). This elementary measure allows to obtain…
Modulo a prime number, we define semi-primitive roots as the square of primitive roots. We present a method for calculating primitive roots from quadratic residues, including semi-primitive roots. We then present progressions that generate…
A famous result due to L. S. Levy provides a classification of all finitely generated indecomposable modules over Dedekind-like rings. This motivates us to outline an approach to the classification of indecomposable pseudo-absorbing primary…
In this paper, we prove a Logarithmic Conjugation Theorem on finitely-connected tori. The theorem states that a harmonic function can be written as the real part of a function whose derivative is analytic and a finite sum of terms involving…
Let $d,n$ be positive integers and $S$ be an arbitrary set of positive integers. We say that $d$ is an $S$-divisor of $n$ if $d|n$ and gcd $(d,n/d)\in S$. Consider the $S$-convolution of arithmetical functions given by (1.1), where the sum…
We first introduce the arithmetic subderivative of a positive integer with respect to a non-empty set of primes. This notion generalizes the concepts of the arithmetic derivative and arithmetic partial derivative. More generally, we then…
A set $\mathcal{A}\subset \mathbb{N}$ is called additively decomposable (resp. asymptotically additively decomposable) if there exist sets $\mathcal{B},\mathcal{C}\subset \mathbb{N}$ of cardinality at least two each such that…
Let A be an augmented algebra over a semi-simple algebra S. We show that the Ext algebra of S as an A-module, enriched with its natural A-infinity structure, can be used to reconstruct the completion of A at the augmentation ideal. We use…
The St. Petersburg paradox presents a longstanding challenge in decision theory: its classical expected value diverges, yet no correspondingly large finite stake is typically regarded as rational. Traditional responses introduce auxiliary…
We prove that the Goodwillie tower of a weak equivalence preserving functor from spaces to spectra can be expressed in terms of the tower for stable mapping spaces. Our proof is motivated by interpreting the functors P_n and D_n as…
In this work, we study resolvent splitting algorithms for solving composite monotone inclusion problems. The objective of these general problems is finding a zero in the sum of maximally monotone operators composed with linear operators.…
We prove that applying a projective functor to a holonomic simple module over a semi-simple finite dimensional complex Lie algebra produces a module that has an essential semi-simple submodule of finite length. This implies that holonomic…
For finite-dimensional Hopf algebras, their classification in characteristic $0$ (e.g. over $\mathbb{C}$) has been investigated for decades with many fruitful results, but their structures in positive characteristic have remained elusive.…
First derivatives of the Whittaker function $\mathrm{M}_{\kappa ,\mu }\left(x\right) $ with respect to the parameters are calculated. Using the confluent hypergeometric function, these derivarives can be expressed as infinite sums of…
We introduce a method for obtaining new classes of free divisors from representations $V$ of connected linear algebraic groups $G$ where $\dim(G)=\dim(V)$, with $V$ having an open orbit. We give sufficient conditions that the complement of…
One of the main issues in computing a tensor decomposition is how to choose the number of rank-one components, since there is no finite algorithms for determining the rank of a tensor. A commonly used approach for this purpose is to find a…
A finite semifield is a division algebra over a finite field where multiplication is not necessarily associative. We consider here the complexity of the multiplication in small semifields and finite field extensions. For this operation, the…
We study the perturbative structure of threshold enhanced logarithms in the coefficient functions of deep inelastic scattering (DIS) and semi-inclusive $e^+e^-$ annihilation (SIA) processes and setup a framework to sum them up to all orders…
Approximating a function with a finite series, e.g., involving polynomials or trigonometric functions, is a critical tool in computing and data analysis. The construction of such approximations via now-standard approaches like least squares…