Related papers: Combined fixed-order and effective-theory approach…
This paper studies stochastic optimization for a sum of compositional functions, where the inner-level function of each summand is coupled with the corresponding summation index. We refer to this family of problems as finite-sum coupled…
Within the OPE, we the new sum rules in Heavy Quark Effective Theory in the heavy quark limit and at order 1/m_Q, using the non-forward amplitude. In particular, we obtain new sum rules involving the elastic subleading form factors chi_i(w)…
This work is an extension of our earlier article, where a well-known integral representation of the logarithmic function was explored, and was accompanied with demonstrations of its usefulness in obtaining compact, easily-calculable, exact…
An old problem in group theory is that of describing how the order of an element behaves under multiplication. To generalize some classical bounds concerning the order $\mathrm o(ab)$ of two elements $a, b$ in a finite abelian group to the…
We consider a monotone submodular maximization problem whose constraint is described by a logic formula on a graph. Formally, we prove the following three `algorithmic metatheorems.' (1) If the constraint is specified by a monadic…
We study a fully discrete finite element method for variable-order time-fractional diffusion equations with a time-dependent variable order. Optimal convergence estimates are proved with the first-order accuracy in time (and second order…
We study kth order systems of two rational difference equations $$x_n=\frac{\alpha+\sum^{k}_{i=1}\beta_{i}x_{n-i} + \sum^{k}_{i=1}\gamma_{i}y_{n-i}}{A+\sum^{k}_{j=1}B_{j}x_{n-j} + \sum^{k}_{j=1}C_{j}y_{n-j}},\quad n\in\mathbb{N},$$…
Fixed-order perturbative calculations for differential cross sections can suffer from non-physical artifacts: they can be non-positive, non-normalizable, and non-finite, none of which occur in experimental measurements. We propose a…
First-order optimization methods are crucial for solving large-scale data processing problems, particularly those involving convex non-smooth composite objectives. For such problems with convex non-smooth composite objectives, we introduce…
We construct an effective field theory valid for processes in which highly energetic light-like particles interact with collinear and soft degrees of freedom, using the decay B -> X_s + gamma near the endpoint of the photon spectrum, x = 2…
The problem of convergence in law of normed sums of exchangeable random variables is examined. First, the problem is studied w.r.t. arrays of exchangeable random variables, and the special role played by mixtures of products of stable laws…
Hamiltonian Truncation Effective Theory is a framework that aims to improve the results of Hamiltonian truncation in a systematic, order-by-order fashion using Effective Field Theory methodology. The result is a truncated effective…
We study binomially weighted summation methods given by \[ (x_n)_{n\in \mathbb{N}} \mapsto \left(\sum_{k=0}^n\binom{n}{k}r^k(1-r)^{n-k}x_k\right)_{n\in \mathbb{N}} \] for $r\in (0,1)$, and their behavior under composition with summation…
Higher-order unification has been shown to be undecidable. Miller discovered the pattern fragment and subsequently showed that higher-order pattern unification is decidable and has most general unifiers. We extend the algorithm to…
We calculate the p-the moment of the sum of n independent random variables with respect to symmetric norm in R^n. The order of growth for upper bound p/ln p obtained in ths estimate is optimal. The result extends to generalized Lorentz…
This paper investigates summability principles for multilinear summing operators. The main result presents a novel inclusion theorem for a class of summing operators, which generalizes several classical results. As applications, we derive…
We study the Hamiltonian truncation for the two-dimensional $\lambda\phi^4$ theory within the framework of Hamiltonian truncation effective theory, where truncation artifacts are mitigated through a systematic inclusion of corrective terms…
In many data analysis pipelines, a basic and time-consuming process is to produce join results and feed them into downstream tasks. Numerous enumeration algorithms have been developed for this purpose. To be a statistically meaningful…
A Lagrange multiplier theorem is derived for the case of an imprecise objective function and a precise constraint. The proof uses methods of analysis which deal in a direct, algebraic way with imprecisions. They include imprecise…
For the \textsc{Minkowski Sum Selection} problem with linear objective functions, we obtain the following results: (1) optimal $O(n\log n)$ time algorithms for $\lambda=1$; (2) $O(n\log^2 n)$ time deterministic algorithms and expected…