Related papers: Multi-Solid Varieties and Mh-Transducers
In this paper, we settle the open complexity status of interval constrained coloring with a fixed number of colors. We prove that the problem is already NP-complete if the number of different colors is 3. Previously, it has only been known…
Color selection plays a critical role in graphic document design and requires sufficient consideration of various contexts. However, recommending appropriate colors which harmonize with the other colors and textual contexts in documents is…
Mackey functors provide the coefficient systems for equivariant cohomology theories. More generally, enriched presheaf categories provide a classification and organization for many stable model categories of interest. Changing enrichments…
We formulate one dimensional many-body integrable systems in terms of a new set of phase space variables involving exchange operators. The hamiltonian in these variables assumes a decoupled form. This greatly simplifies the derivation of…
The finite satisfiability problem of two-variable logic extended by a linear order successor and a preorder successor is shown to be undecidable.
In this paper we present a self-supervised method for representation learning utilizing two different modalities. Based on the observation that cross-modal information has a high semantic meaning we propose a method to effectively exploit…
Complex valued systems with an indefinite matrix term arise in important applications such as for certain time-harmonic partial differential equations such as the Maxwell's equation and for the Helmholtz equation. Complex systems with…
Hindman's Theorem states that in any finite coloring of the integers, there is an infinite set all of whose finite sums belong to the same color. This is much stronger than the corresponding finite form, stating that in any finite coloring…
Quantum interfaces between polarized atomic ensembles and coherent states of light, applied recently to manipulate bipartite and multipartite entanglement, are revisited by means of a continuous-variable formalism. The explicit use of the…
Total coloring of a graph is a coloring of its vertices and edges such that adjacent or incident elements receive distinct colors. Total coloring conjecture (stipulating that the total chromatic number of a graph $G$ is at most…
For a Veech surface (x,\omega), we characterize subspaces of X^n, invariant under the diagonal action of the affine group of X. We prove that non-arithmetic Veech surfaces have only finitely many invariant subspaces of very particular shape…
A classical question in combinatorial number theory asks whether an equation has a solution inside a particular subset of its domain. The Rado's Theorem gives a set of necessary and sufficient conditions for a systems of linear equations to…
We study the problem of learning overcomplete HMMs---those that have many hidden states but a small output alphabet. Despite having significant practical importance, such HMMs are poorly understood with no known positive or negative results…
In this paper, we mainly investigate distortion and covering theorems on some classes of pluriharmonic mappings.
We address the problem of characterizing $H$-coloring problems that are first-order definable on a fixed class of relational structures. In this context, we give several characterizations of a homomorphism dualities arising in a class of…
We study the satisfiability and model-checking problems for timed hyperproperties specified with HyperMTL, a timed extension of HyperLTL. Depending on whether interleaving of events in different traces is allowed, two possible semantics can…
The discussion of enhancement of superconductivity is presented in the framework of the higher-grade hybrid model of layered superconductors. The enhancement is considered from the following two points of view: (i) as a result of long-range…
We build free, bigraded bidifferential algebra models for the forms on a complex manifold, with respect to a strong notion of quasi-isomorphism and compatible with the conjugation symmetry. This answers a question of Sullivan. The resulting…
The article contains some important classes of multisets. Combinatorial proofs of problems on the number of m-submultisets and m-permutations of multiset elements are considered and effective algorithms for their calculation are given. In…
In this paper, we consider the problem of a star coloring. In general case the problems in NP-complete. We establish the star chromatic number for splitting graph of complete and complete bipartite graphs, as well of paths and cycles. Our…