Related papers: Open problems in Costas arrays
The purpose of this paper is to continue studying the properties of $\gamma$-regular open sets introduced and explored in [6]. The concept of $\gamma$-closed spaces have also been defined and discussed.
Fifteen years after their discovery, ample fields now stand at the center of research in contemporary Galois theory and attract more and more attention also from other areas of mathematics. This survey gives an introduction to the theory of…
We describe a list of open problems in random matrix theory and integrable systems which was presented at the conference ``Integrable Systems, Random Matrices, and Applications'' at the Courant Institute in May 2006.
In [7], we introduced the category of chain bundles with examples and established its significance. Here we shall describe certain categories which we call the category of chains in the chain bundle category and discuss some interesting…
The sets of the integrable lattice equations, which generalize the Toda lattice, are considered. The hierarchies of the first integrals and infinitesimal symmetries are found. The properties of the multi-soliton solutions are discussed.
A category used by de Paiva to model linear logic also occurs in Vojtas's analysis of cardinal characteristics of the continuum. Its morphisms have been used in describing reductions between search problems in complexity theory. We describe…
We give new arguments for sums and products of sufficient numbers of arbitrary central Cantor sets to produce large open intervals. We further discuss the same question for $C^1$ images of such central Cantor sets. This gives another…
This is an update on, and expansion of, our paper Open problems on $\beta\omega$ in the book Open Problems in Topology.
We present some variations on some of the main open problems on character degrees. We collect some of the methods that have proven to be very useful to work on these problems. These methods are also useful to solve certain problems on zeros…
We provide a general definition of Toda brackets in a pointed model categories, show how they serve as obstructions to rectification, and explain their relation to the classical stable operations.
This paper addresses two classes of different, yet interrelated optimization problems. The first class of problems involves a robot that must locate a hidden target in an environment that consists of a set of concurrent rays. The second…
This is a proposal of an algebra which aims at distributed array processing. The focus lies on re-arranging and distributing array data, which may be multi-dimensional. The context of the work is scientific processing; thus, the core…
The aim of this paper is to define what we shall call open graphic dynamics, their interactions and the dynamics produced by those interactions. It prepares the study of "open sub-categorical dynamics" and "open categorical dynamics".
This chapter is divided into two parts. The first part is a survey of some recent results on nests and the orderability problem. The second part consists of results, partial results and open questions, all viewed in the light of nests. From…
Abstract basins appear naturally in different areas of several complex variables. In this survey we want to describe three different topics in which they play an important role, leading to interesting open problems.
We discuss the use of inequalities to obtain the solution of certain variational problems on time scales.
We confront existing definitions of chaos with the state of the art in topological dynamics. The article does not propose any new definition of chaos but, starting from several topological properties that can be reasonably called chaotic,…
In colored range counting (CRC), the input is a set of points where each point is assigned a ``color'' (or a ``category'') and the goal is to store them in a data structure such that the number of distinct categories inside a given query…
Matrix partition problems generalize a number of natural graph partition problems, and have been studied for several standard graph classes. We prove that each matrix partition problem has only finitely many minimal obstructions for split…
In this note we present a brief overview of variational methods to solve homogenization problems. The purpose is to give a first insight on the subject by presenting some fundamental theoretical tools, both classical and modern. We conclude…