English
Related papers

Related papers: Separability Problems in Creative Telescoping

200 papers

We propose a generalization of separability in the context of global optimization. Our results apply to objective functions implemented as differentiable computer programs. They are presented in the context of a simple branch and bound…

Optimization and Control · Mathematics 2023-05-10 Jens Deussen , Uwe Naumann

The study of essential and strongly essential variables in functions defined on finite sets is a part of $k$-valued logic. We extend the main definitions from functions to terms. This allows us to apply concepts and results of Universal…

Rings and Algebras · Mathematics 2008-12-11 Slavcho Shtrakov , Klaus Denecke

We analyze single particle coherence and interference in the presence of particle loss and derive an inequality that relates the preservation of coherence, the creation of superposition with the vacuum, and the degree of particle loss. We…

Quantum Physics · Physics 2007-05-23 Johan Aberg , Daniel K. L. Oi

It is shown that for "ideal" macroscopic objects there are superselection rules forbidding superpositions of macroscopically distinguishable states of the objects. For real macroscopic bodies the notion of "weak" superselection rules is…

Quantum Physics · Physics 2007-05-23 Lev Prokhorov

Cubic and quartic non-autonomous differential equations with continuous piecewise linear coefficients are considered. The main concern is to find the maximum possible multiplicity of periodic solutions. For many classes, we show that the…

Classical Analysis and ODEs · Mathematics 2010-10-01 Mohamad Ali Alwash

A separator for two languages is a third language containing the first one and disjoint from the second one. We investigate the following decision problem: given two regular input languages, decide whether there exists a locally testable…

Formal Languages and Automata Theory · Computer Science 2015-07-01 Thomas Place , Lorijn van Rooijen , Marc Zeitoun

Several works have recently investigated the parameterized complexity of data completion problems, motivated by their applications in machine learning, and clustering in particular. Interestingly, these problems can be equivalently…

Data Structures and Algorithms · Computer Science 2024-07-16 Eduard Eiben , Robert Ganian , Iyad Kanj , Sebastian Ordyniak , Stefan Szeider

The satisfiability problem for SPARQL patterns is undecidable in general, since the expressive power of SPARQL 1.0 is comparable with that of the relational algebra. The goal of this paper is to delineate the boundary of decidability of…

Databases · Computer Science 2016-06-03 Xiaowang Zhang , Jan Van den Bussche , François Picalausa

Two broad classes of graphical modeling problems for codes can be identified in the literature: constructive and extractive problems. The former class of problems concern the construction of a graphical model in order to define a new code.…

Information Theory · Computer Science 2007-07-13 Thomas R. Halford , Keith M. Chugg

Optical designs for astronomy involve implementation of active optics and adaptive optics from X-ray to the infrared. Developments and results of active optics methods for telescopes, spectrographs and coronagraph planet finders are…

Instrumentation and Methods for Astrophysics · Physics 2015-06-15 Gerard R. Lemaitre

Specification of the strongest possible Bell inequalities for arbitrarily complicated physical scenarios -- any number of observers choosing between any number of observables with any number of possible outcomes -- is currently an open…

Quantum Physics · Physics 2015-12-17 Brandon Fogel

In considering the reliability of numerical programs, it is normal to "limit our study to the semantics dealing with numerical precision" (Martel, 2005). On the other hand, there is a great deal of work on the reliability of programs that…

Symbolic Computation · Computer Science 2014-04-25 James H. Davenport , Russell Bradford , Matthew England , David Wilson

Semantic image segmentation is an important computer vision task that is difficult because it consists of both recognition and segmentation. The task is often cast as a structured output problem on an exponentially large output-space, which…

Computer Vision and Pattern Recognition · Computer Science 2017-09-07 Payman Yadollahpour

We propose a way to split a given bivariate P-recursive sequence into a summable part and a non-summable part in such a way that the non-summable part is minimal in some sense. This decomposition gives rise to a new reduction-based creative…

Symbolic Computation · Computer Science 2023-11-10 Shaoshi Chen , Lixin Du , Manuel Kauers , Rong-Hua Wang

This paper shows that it is computationally hard to decide (or test) if a consumption data set is consistent with separable preferences.

Computer Science and Game Theory · Computer Science 2014-01-21 Federico Echenique

The main thrust of our current work is to exploit very specific characteristics of a given problem in order to acquire improved compactness for supercritical problems and to prove existence of new types of solutions. To this end, we shall…

Analysis of PDEs · Mathematics 2022-06-28 Craig Cowan , Abbas Moameni

Today's software engineering (SE) complexities require a more diverse tool set going beyond technical expertise to be able to successfully tackle all challenges. Previous studies have indicated that creativity is a prime indicator for…

Software Engineering · Computer Science 2025-02-06 Wouter Groeneveld

Every year, hundreds of images from telescopes on the ground and in space are released to the public, making their way into popular culture through everything from computer screens to postage stamps. These images span the entire…

Instrumentation and Methods for Astrophysics · Physics 2013-08-27 Kimberly K. Arcand , Megan Watzke , Travis Rector , Zoltan G. Levay , Joseph DePasquale , Olivia Smarr

We study a functional defined on the class of piecewise constant functions, combining a jump penalization, which discourages discontinuities, with a fidelity term that penalizes deviations from a given linear function, called the forcing…

Analysis of PDEs · Mathematics 2025-06-23 Massimo Gobbino , Nicola Picenni

The concept of viewing graph solvability has gained significant interest in the context of structure-from-motion. A viewing graph is a mathematical structure where nodes are associated to cameras and edges represent the epipolar geometry…

Computer Vision and Pattern Recognition · Computer Science 2025-04-07 Federica Arrigoni , Kathlén Kohn , Andrea Fusiello , Tomas Pajdla