Related papers: A generic characterization of Pol(C)
We construct a generalized version for the free product of unital C*-algebras over a family of unital C*-subalgebras, starting from the group-analogue. When all the subalgebras are the same, we recover the free product with amalgamation…
In this work we describe preferential Description Logics of typicality, a nonmonotonic extension of standard Description Logics by means of a typicality operator T allowing to extend a knowledge base with inclusions of the form T(C) v D,…
Fox et al. [SIAM J. Comp. 2020] introduced a new parameter, called $c$-closure, for a parameterized study of clique enumeration problems. A graph $G$ is $c$-closed if every pair of vertices with at least $c$ common neighbors is adjacent.…
Widespread use of string solvers in formal analysis of string-heavy programs has led to a growing demand for more efficient and reliable techniques which can be applied in this context, especially for real-world cases. Designing an…
We use geometric and cohomological methods to show that given a degree bound for membership in ideals of a fixed degree type in the polynomial ring P=k[x_0,..., x_d], one obtains a good generic degree bound for membership in the tight…
The valence of a function $f$ at a point $w$ is the number of distinct, finite solutions to $f(z) = w$. Let $f$ be a complex-valued harmonic function in an open set $R \subseteq \mathbb{C}$. Let $S$ denote the critical set of $f$ and $C(f)$…
In this note, we provide a simple derivation of expressions for the restricted partition function and its polynomial part. Our proof relies on elementary algebra on rational functions and a lemma that expresses the polynomial part as an…
One of the few available complete methods for checking the satisfiability of sets of polynomial constraints over the reals is the cylindrical algebraic covering (CAlC) method. In this paper, we propose an extension for this method to…
We study closedness of the range, adjointability and generalized invertibility of modular operators between Hilbert modules over locally C*-algebras of coefficients. Our investigations and the recent results of M. Frank [Characterizing…
The core of a formal semantics of an imperative programming language is a memory model that describes the behavior of operations on the memory. Defining a memory model that matches the description of C in the C11 standard is challenging…
This article presents a general solution to the problem of computational complexity. First, it gives a historical introduction to the problem since the revival of the foundational problems of mathematics at the end of the 19th century.…
Complex polynomial optimization has recently gained more and more attention in both theory and practice. In this paper, we study the optimization of a real-valued general conjugate complex form over various popular constraint sets including…
We establish new metric characterizations for the norm (respectively, ultraweak) closure of the convex hull of a bounded set in an arbitrary $C^*$-algebra (respectively, von Neumann algebra), and provide applications of these results to the…
We study regular expressions that use variables, or parameters, which are interpreted as alphabet letters. We consider two classes of languages denoted by such expressions: under the possibility semantics, a word belongs to the language if…
The Locker Problem is frequently used in introducing some topics in elementary number theory like divisors and multiples. It appears in many curricula ranging from elementary, secondary and up to tertiary level. In this paper, I will…
We aim at enforcing hard constraints to impose a global structure on sequences generated from Markov models. In this report, we study the complexity of sampling Markov sequences under two classes of constraints: Binary Equalities and…
This PhD deals with the notion of pseudo algebraically closed (PAC) extensions of fields. It develops a group-theoretic machinery, based on a generalization of embedding problems, to study these extensions. Perhaps the main result is that…
We study subsets of groups and monoids defined by language-theoretic means, generalizing the classical approach to the word problem. We expand on results by Herbst from 1991 to a more general setting, and for a class of languages…
We present our public-domain software for the following tasks in sparse (or toric) elimination theory, given a well-constrained polynomial system. First, C code for computing the mixed volume of the system. Second, Maple code for defining…
We study the complexity of satisfiability problems in probabilistic and causal reasoning. Given random variables $X_1, X_2,\ldots$ over finite domains, the basic terms are probabilities of propositional formulas over atomic events $X_i =…