相关论文: Ordinal and cardinal solution concepts for two-sid…

We define the two-dimensional $O(n)$ conformal field theory as a theory that includes the critical dilute and dense $O(n)$ models as special cases, and depends analytically on the central charge. For generic values of $n\in\mathbb{C}$, we…

We introduce the notion of n-mating in this work, which includes the classical mating of polynomials as a special case. The new notion brings further links between the polynomial world and the rational world than the classical one, as well…

There has recently been work by multiple groups in extracting the properties associated with cardinal invariants of the continuum and translating these properties into similar analogous combinatorial properties of computational oracles.…

Non-forking is one of the most important notions in modern model theory capturing the idea of a generic extension of a type (which is a far-reaching generalization of the concept of a generic point of a variety). To a countable first-order…

On one hand, termination analysis of logic programs is now a fairly established research topic within the logic programming community. On the other hand, non-termination analysis seems to remain a much less attractive subject. If we divide…

Given a set of points in the plane, we are interested in matching them with straight line segments. We focus on perfect (all points are matched) non-crossing (no two edges intersect) matchings. Apart from the well known MinMax variation,…

This paper offers a comprehensive treatment of the question as to whether a binary relation can be consistent (transitive) without being decisive (complete), or decisive without being consistent, or simultaneously inconsistent or…

For a relation that violates a set of functional dependencies, we consider the task of finding a maximum number of pairwise-consistent tuples, or what is known as a "cardinality repair." We present a polynomial-time algorithm that, for…

Two-dimensional patterns are used in many research areas in computer science, ranging from image processing to specification and verification of complex software systems (via scenarios). The contribution of this paper is twofold. First, we…

We introduce and study some variants of a notion of canonical set theoretical truth. By this, we mean truth in a transitive proper class model $M$ of ZFC that is uniquely characterized by some $\in$-formula. We show that there are…

Symmetry groups allow to transform solutions of differential equations continuously into other solutions. This property can be used for the observability analysis of infinite-dimensional systems with input and output. In this contribution,…

The study of noncommutative solitons is greatly facilitated if the field equations are integrable, i.e. result from a linear system. For the example of a modified but integrable U(n) sigma model in 2+1 dimensions we employ the dressing…

We show how to implement the background field method by means of canonical transformations and comment on the applications of the method to non-perturbative techniques in non-Abelian gauge theories. We discuss the case of the lattice in…

Two essential methods, the symmetry analysis and of the singularity analysis, for the study of the integrability of nonlinear ordinary differential equations are discussed. The main similarities and differences of these two different…

Using the theory of fixed point index, we discuss the existence and multiplicity of non-negative solutions of a wide class of boundary value problems with coupled nonlinear boundary conditions. Our approach is fairly general and covers a…

We show that many large cardinal notions can be characterized in terms of the existence of certain elementary embeddings between transitive set-sized structures, that map their critical point to the large cardinal in question. In…

We study the two-sided stable matching problem with one-sided uncertainty for two sets of agents A and B, with equal cardinality. Initially, the preference lists of the agents in A are given but the preferences of the agents in B are…

We reduce the problem of finding an augmenting path in a general graph to a reachability problem in a directed bipartite graph. A slight modification of depth-first search leads to an algorithm for finding such paths. Although this setting…

This paper connects discrete optimal transport to a certain class of multi-objective optimization problems. In both settings, the decision variables can be organized into a matrix. In the multi-objective problem, the notion of Pareto…

We describe a novel algorithm for solving general parametric (nonlinear) eigenvalue problems. Our method has two steps: first, high-accuracy solutions of non-parametric versions of the problem are gathered at some values of the parameters;…