Related papers: Open problems in Costas arrays

We propose a set of questions on the dynamics of H\'enon maps from the real, complex, algebraic and arithmetic points of view.

A variant of the well-known Set Covering Problem is studied in this paper, where subsets of a collection have to be selected, and pairwise conflicts among subsets of items exist. The selection of each subset has a cost, and the inclusion of…

Various simplicial complexes can be associated with a graph. Box complexes form an important families of such simplicial complexes and are especially useful for providing lower bounds on the chromatic number of the graph via some of their…

We introduce Rota-Baxter categories and construct examples of such structures.

We present and discuss seven different open problems in applied combinatorics. The application areas relevant to this compilation include quantum computing, algorithmic differentiation, topological data analysis, iterative methods,…

Presentation of set matrices and demonstration of their efficiency as a tool using the path/cycle problem.

This is a list of some problems and conjectures related to various types of algebras, that is to algebraic operads. Some comments and hints are included.

This note presents a discussion of the algebraic and combinatorial aspects of the theory of pure O-sequences. Various instances where pure O-sequences appear are described. Several open problems that deserve further investigation are also…

The contour of a family of filters along a filter is a set-theoretic lower limit. Topologicity and regularity of convergences can be characterized with the aid of the contour operation. Contour inversion is studied, in particular, for…

We introduce the notion of soficity for locally compact groups and list a number of open problems.

This brief note gives a survey on results relating to existence of closed points on schemes, including an elementary topological characterization of the schemes with (at least one) closed point.

We characterize the order of principal congruences of a bounded lattice as a bounded ordered set. We also state a number of open problems in this new field.

We present classes of discrete reversible systems which are at the same time chaotic and solvable.

We give a definition for Obstacle Problems with measure data and general obstacles. For such problems we prove existence and uniqueness of solutions and consistency with the classical theory of Variational Inequalities. Continuous…

Some Open Problems Concerning Orthogonal Polynomials.

A fork stack is a generalised stack which allows pushes and pops of several items at a time. We consider the problem of determining which input streams can be sorted using a single forkstack, or dually, which permutations of a fixed input…

Systems are growing into more complex ones for developing and maintaining. Existing systems which do not have much in common on the first look are connected, due to the technical progress, even if it was never intended that way. It is an…

In this paper we introduce an open-closed cobordism category with maps to a background space. We identify the classifying space of this category for certain classes of background space. The key ingredient is the homology stability of…

Mass partition problems describe the partitions we can induce on a family of measures or finite sets of points in Euclidean spaces by dividing the ambient space into pieces. In this survey we describe recent progress in the area in addition…

A special case of the satisfiability problem, in which the clauses have a hierarchical structure, is shown to be solvable in linear time, assuming that the clauses have been represented in a convenient way.