Related papers: Towards a symbolic summation theory for unspecifie…
We describe and prove correctness of two practical algorithms for finding indecomposable summands of finitely generated modules over a finitely generated k-algebra R. The first algorithm applies in the (multi)graded case, which enables the…
Abstractive text summarization is a highly difficult problem, and the sequence-to-sequence model has shown success in improving the performance on the task. However, the generated summaries are often inconsistent with the source content in…
Distorted sums of models were introduced and discussed in [Sh:463]. This notion generalizes the notion of disjoint (or direct) sums of models by letting the summands overlap. In the first section we investigate types in distorted sums and…
We see how nested sequents, a natural generalisation of hypersequents, allow us to develop a systematic proof theory for modal logics. As opposed to other prominent formalisms, such as the display calculus and labelled sequents, nested…
We prove a summation formula for a bilateral series whose terms are products of two basic hypergeometric functions. In special cases, series of this type arise as matrix elements of quantum group representations.
Parameterized telescoping (including telescoping and creative telescoping) and refined versions of it play a central role in the research area of symbolic summation. Karr introduced 1981 $\Pi\Sigma$-fields, a general class of difference…
We present BayeSum (for ``Bayesian summarization''), a model for sentence extraction in query-focused summarization. BayeSum leverages the common case in which multiple documents are relevant to a single query. Using these documents as…
Truncated sum rules have been used to calculate the fundamental limits of the nonlinear susceptibilities; and, the results have been consistent with all measured molecules. However, given that finite-state models result in inconsistencies…
Given a manifold $\mathbb{M}$ admitting a maximally supersymmetric consistent truncation, we show how to formulate new consistent truncations by restricting to a set of Kaluza-Klein modes on $\mathbb{M}$ invariant under some subgroup of the…
In difference algebra, summability arises as a basic problem upon which rests the effective solution of other more elaborate problems, such as creative telescoping problems and the computation of Galois groups of difference equations. In…
For any given sum of squares domain in $\mathbb{C}^n,$ we reduce the complexity in Catlin's multitype techniques by giving a complete normalization of the geometry. Using this normalization result, we present a more elementary proof of the…
We generalize a terminating summation formula to a unilateral nonterminating, and further, a bilateral summation formula by a property of analytic functions. The unilateral one is proved to be a $q$-analogue of a $_4F_3$-summation formula.…
We present a generalization of first-order unification to a term algebra where variable indexing is part of the object language. We exploit variable indexing by associating some sequences of variables ($X_0,\ X_1,\ X_2,\dots$) with a…
We define weighted mean summability method of double sequences in intuitionistic fuzzy normed spaces($IFNS$), and obtain necessary and sufficient Tauberian conditions under which convergence of double sequences in $IFNS$ follows from their…
This work addresses the challenge of providing consistent explanations for predictive models in the presence of model indeterminacy, which arises due to the existence of multiple (nearly) equally well-performing models for a given dataset…
This paper proposes a fundamentally new paradigm for image generation through set-based tokenization and distribution modeling. Unlike conventional methods that serialize images into fixed-position latent codes with a uniform compression…
Given a set (or multiset) S of n numbers and a target number t, the subset sum problem is to decide if there is a subset of S that sums up to t. There are several methods for solving this problem, including exhaustive search,…
In this work we present a new simple but efficient scheme - Subsquares approach - for development of algorithms for enclosing the solution set of overdetermined interval linear systems. We are going to show two algorithms based on this…
Power series in which the summand satisfies a linear recurrence relation with polynomial coefficients are shown to be the solution of a linear differential or algebraic equation. Solving the associated differential or algebraic equation…
Renormalized homotopy continuation on toric varieties is introduced as a tool for solving sparse systems of polynomial equations, or sparse systems of exponential sums. The cost of continuation depends on a renormalized condition length,…