Related papers: A generic characterization of Pol(C)
We show a partial Boolean function $f$ together with an input $x\in f^{-1}\left(*\right)$ such that both $C_{\bar{0}}\left(f,x\right)$ and $C_{\bar{1}}\left(f,x\right)$ are at least $C\left(f\right)^{2-o\left(1\right)}$. Due to recent…
We contribute to a recent research program which aims at revisiting the study of the complexity of word problems, a major area of research in combinatorial algebra, through the lens of the theory of computably enumerable equivalence…
The purpose of this paper is to give a characterisation of divided power algebras over a reduced operad. Such a characterisation is given in terms of polynomial operations, following the classical example of divided power algebras. We…
A graph is $c$-closed when every pair of nonadjacent vertices has at most $c-1$ common neighbors. In $c$-Closed Vertex Deletion, the input is a graph $G$ and an integer $k$ and we ask whether $G$ can be transformed into a $c$-closed graph…
Modular exponentiation is a common mathematical operation in modern cryptography. This, along with modular multiplication at the base and exponent levels (to different moduli) plays an important role in a large number of key agreement…
It is well known that, under certain conditions, it is possible to split logic programs under stable model semantics, i.e. to divide such a program into a number of different "levels", such that the models of the entire program can be…
In the framework of computational complexity and in an effort to define a more natural reduction for problems of equivalence, we investigate the recently introduced kernel reduction, a reduction that operates on each element of a pair…
This is a short review of some recent results obtained by the author. These results are related the problem of obtaining polynomial identities (computational formulas) for some matrix functions by means of the known polarization theorem,…
A semiregular operator on a Hilbert C^*-module, or equivalently, on the C^*-algebra of `compact' operators on it, is a closable densely defined operator whose adjoint is also densely defined. It is shown that for operators on extensions of…
We observe that the vocabulary used to construct the "answer" to problems in computer algebra can have a dramatic effect on the computational complexity of solving that problem. We recall a formalization of this observation and explain the…
In this paper, we study the differential power operation on ideals. We begin with a focus on monomial ideals in characteristic 0 and find a class of ideals whose differential powers are eventually principal. We also study the containment…
We give new characterizations to ensure that a free product of groups with amalgamation has a simple reduced group C*-algebra, and provide a concrete example of an amalgam with trivial kernel, such that its reduced group C*-algebra has a…
This paper develops an operational semantics for a release-acquire fragment of the C11 memory model with relaxed accesses. We show that the semantics is both sound and complete with respect to the axiomatic model. The semantics relies on a…
Expanding upon recent work, a new class of $A$-functions is introduced that can be viewed as an appropriate generalization of the class of regular $A$-functions, the class of structured $A$-functions, and the class of perfect $A$-functions.…
We prove that unital graph C*-algebras often admit a convenient decomposition into amalgamated free products. We use this to give a complete characterization of when a unital graph C*-algebra is residually finite-dimensional and when it is…
Many natural combinatorial problems can be expressed as constraint satisfaction problems. This class of problems is known to be NP-complete in general, but certain restrictions on the form of the constraints can ensure tractability. The…
This thesis is intended to provide an account of the theory and applications of Operational Methods that allow the "translation" of the theory of special functions and polynomials into a "different" mathematical language. The language we…
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on a template, usually a set of relations, upon which they are…
In this paper we revisit the work of E.T. Bell concerning partition polynomials in order to introduce the reciprocal partition polynomials. We give their explicit formulas and apply the result to compute closed formulae for some well-known…
In this paper we present algorithmic considerations and theoretical results about the relation between the orders of certain groups associated to the components of a polynomial and the order of the group that corresponds to the polynomial,…