Related papers: Three Problems of "Distinction"
Equidistribution of the orbits of points, subvarieties or of periodic points in complex dynamics is a fundamental problem. It is often related to strong ergodic properties of the dynamical system and to a deep understanding of analytic…
This article provides an overview of the performance and the theoretical complexity of approximate and exact methods for various versions of the shortest path problem. The proposed study aims to improve the resolution of a more general…
In recent literature there are an increasing number of papers where the forbidden sets of difference equations are computed. We review and complete different attempts to describe the forbidden set and propose new perspectives for further…
We discuss some fundamental issues underlying gravitational physics and point out some of the main shortcomings of Einstein's General Relativity. In particular, after taking into account the role of the two main objects of relativistic…
This paper presents an equivalence theorem for three different kinds of optimal control problems, which are optimal target control problems, optimal norm control problems and optimal time control problems. Controlled systems in this study…
In 1946, Erd\H{o}s posed the distinct distance problem, which seeks to find the minimum number of distinct distances between pairs of points selected from any configuration of $n$ points in the plane. The problem has since been explored…
We apply the theory of disconjugate linear recurrence relations to the study of irrational quantities in number theory. In particular, for an irrational number associated with solutions of three-term linear recurrence relations we show that…
This article deals with variational optimal-control problems on time scales in the presence of delay in the state variables. The problem is considered on a time scale unifying the discrete, the continuous and the quantum cases. Two examples…
We treat a version of the multiple-choice secretary problem called the multiple-choice duration problem, in which the objective is to maximize the time of possession of relatively best objects. It is shown that, for the $m$--choice duration…
In the paper is considered two problems on extension of operators whose range space for the first problem (or domain space for the second one) belongs to the fixed class of finite equivalence, which is generated by a given Banach space $X$.…
In this paper, we analyze the problem of how to adapt the concept of proportionality to situations where several perfectly divisible resources have to be allocated among certain set of agents that have exactly one claim which is used for…
Transductions are binary relations of finite words. For rational transductions, i.e., transductions defined by finite transducers, the inclusion, equivalence and sequential uniformisation problems are known to be undecidable. In this paper,…
We investigate a class of nonlinear nonautonomous scalar field equations with fractional diffusion, critical power nonlinearity and a subcritical term. The involved potentials are allowed for vanishing behavior at infinity. The problem is…
The $q$-ary block codes with two distances $d$ and $d+1$ are considered. Several constructions of such codes are given, as in the linear case all codes can be obtained by a simple modification of linear equidistant codes. Upper bounds for…
Discrepancy measures how uniformly distributed a point set is with respect to a given set of ranges. There are two notions of discrepancy, namely continuous discrepancy and combinatorial discrepancy. Depending on the ranges, several…
I offer a case that quantum query complexity still has loads of enticing and fundamental open problems -- from relativized QMA versus QCMA and BQP versus IP, to time/space tradeoffs for collision and element distinctness, to polynomial…
A code $C \subseteq \{0, 1, 2\}^n$ of length $n$ is called trifferent if for any three distinct elements of $C$ there exists a coordinate in which they all differ. By $T(n)$ we denote the maximum cardinality of trifferent codes with length.…
We introduce the framework of qualitative optimization problems (or, simply, optimization problems) to represent preference theories. The formalism uses separate modules to describe the space of outcomes to be compared (the generator) and…
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…
We consider the partition lattice $\Pi_\kappa$ on any set of transfinite cardinality $\kappa$ and properties of $\Pi_\kappa$ whose analogues do not hold for finite cardinalities. Assuming the Axiom of Choice we prove: (I) the cardinality of…