Related papers: Inverse monoids associated with the complexity cla…
We investigate an approach to matroid complexity that involves describing a matroid via a list of independent sets, bases, circuits, or some other family of subsets of the ground set. The computational complexity of algorithmic problems…
Let $P\subset\mathbb R^n$ be a convex polytope and let $\ell$ be a linear functional which is nonconstant on every edge of $P$. The induced acyclic orientation determines positive and negative Bia{\l}ynicki-Birula type partitions of $P$…
In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…
Most problems in natural language processing can be approximated as inverse problems such as analysis and generation at variety of levels from morphological (e.g., cat+Plural <-> cats) to semantic (e.g., (call + 1 2) <-> "Calculate one plus…
In arXiv:1709.07504 Aguiar and Ardila give a Hopf monoid structure on hypergraphs as well as a general construction of polynomial invariants on Hopf monoids. Using these results, we define in this paper a new polynomial invariant on…
This paper discusses why P and NP are likely to be different. It analyses the essence of the concepts and points out that P and NP might be diverse by sheer definition. It also speculates that P and NP may be unequal due to natural laws.
We study the problem of finding the resistors in a resistor network from measurements of the power dissipated by the resistors under different loads. We give sufficient conditions for local uniqueness, i.e. conditions that guarantee that…
In this paper, we consider the inverse submonoids $AM_n$ of monotone transformations and $AO_n$ of order-preserving transformations of the alternating inverse monoid $AI_n$ on a chain with $n$ elements. We compute the cardinalities,…
We show how to reconstruct the topology on the monoid of endomorphisms of the rational numbers under the strict or reflexive order relation, and the polymorphism clone of the rational numbers under the reflexive relation. In addition we…
Inverse spectral problems are studied for the second order integro-differential operators on a finite interval. Properties of spectral characteristic are established, and the uniqueness theorem is proved for this class of inverse problems.
(I) We study Clifford-Mackey-Rieffel's theory for finite monoid; (II) We prove some results of Theta Representations of finite inverse monoids.
In this paper we study unimodality problems for the independence polynomial of a graph, including unimodality, log-concavity and reality of zeros. We establish recurrence relations and give factorizations of independence polynomials for…
In many tasks, in particular in natural science, the goal is to determine hidden system parameters from a set of measurements. Often, the forward process from parameter- to measurement-space is a well-defined function, whereas the inverse…
The central conjecture of parameterized complexity states that FPT is not equal to W[1], and is generally regarded as the parameterized counterpart to P != NP. We revisit the issue of the plausibility of FPT != W[1], focusing on two…
In this paper we examine an inverse problem in the modular theory of von Neumann algebras in the case of finite factors. First we give a characterization of cyclic and separating vectors for finite factors in terms of operators associated…
We provide estimators for a large class of inverse problems, including nonlinear inverse problems. Using complexity regularization technics we provide adaptive estimators achieving the best rate over the collection of models.
Regularization plays a key role in a variety of optimization formulations of inverse problems. A recurring theme in regularization approaches is the selection of regularization parameters, and their effect on the solution and on the optimal…
The complexity class DP is the class of all languages that are the intersection of a language in NP and a language in coNP. It was conjectured that recognizing a facet for the knapsack polytope is DP-complete. We provide a positive answer…
We give direct and inverse theorems for the weighted approximation of functions with inner singularities by combinations of Bernstein polynomials.
Schindler recently addressed two versions of the question P $\stackrel{?}{=}$ NP for Turing machines running in transfinite ordinal time. These versions differ in their definition of input length. The corresponding complexity classes are…