相关论文: Some interesting problems
Over 300 sequences and many unsolved problems and conjectures related to them are presented herein. These notions, definitions, unsolved problems, questions, theorems corollaries, formulae, conjectures, examples, mathematical criteria, etc.…
The material of this work is aimed at mathematics educators, as well as math specialists with a keen interest in progressions. In this paper, we study the subject of arithmetic, geometric, mixed, and harmonic progressions or sequences. Some…
We give new approximation algorithms for the submodular joint replenishment problem and the inventory routing problem, using an iterative rounding approach. In both problems, we are given a set of $N$ items and a discrete time horizon of…
An analytical approach to convolution of functions, which appear in perturbative calculations, is discussed. An extended list of integrals is presented.
An open ended list is a well known data structure in Prolog programs. It is frequently used to represent a value changing over time, while this value is referred to from several places in the data structure of the application. A weak point…
A brief account is given of the problems involved in extended the pinch technique beyond the one-loop level, and of investigations into one possible approach to solving them.
Edge-matching problems, also called edge matching puzzles, are abstractions of placement problems with neighborhood conditions. Pieces with colored edges have to be placed on a board such that adjacent edges have the same color. The problem…
Efficient consistency maintenance of incomplete and dynamic real-life databases is a quality label for further data analysis. In prior work, we tackled the generic problem of database updating in the presence of tuple generating constraints…
Hub Covering Problems arise in various practical domains, such as urban planning, cargo delivery systems, airline networks, telecommunication network design, and e-mobility. The task is to select a set of hubs that enable tours between…
In the past few years, the research on sober spaces and well-filtered spaces has got some breakthrough progress. In this paper, we shall present a brief summarising survey on some of such development. Furthermore, we shall pose and…
The status of QCD phenomena and open problems are reviewed
Optimisation algorithms are commonly compared on benchmarks to get insight into performance differences. However, it is not clear how closely benchmarks match the properties of real-world problems because these properties are largely…
This paper is an overview and survey of work on the 3x+1 problem, also called the Collatz problem, and generalizations of it. It gives a history of the problem. It addresses two questions: (1) What can mathematics currently say about this…
Ranking problems, also known as preference learning problems, define a widely spread class of statistical learning problems with many applications, including fraud detection, document ranking, medicine, credit risk screening, image ranking…
In this paper, we study three algorithmic problems involving computation trees: the optimization, solvability, and satisfiability problems. The solvability problem is concerned with recognizing computation trees that solve problems. The…
The article describes an attempt to solve at once three basic problems arising at testing a complex digital equipment for defects: 1) the problem of an exponential increasing of the complexity of testing the equipment with the complexity of…
Boolean networks are a general model of interacting entities, with applications to biological phenomena such as gene regulation. Attractors play a central role, and the schedule of entities update is a priori unknown. This article presents…
We consider the problem of updating the information about multiple longest common sub-sequences. This kind of sub-sequences is used to highlight information that is shared across several information sequences, therefore it is extensively…
Is secure deletion of data still a problem?
Some Open Problems Concerning Orthogonal Polynomials.