Related papers: New Combinatorial Complete One-Way Functions
Imposing some conditions on derivatives of the known functions, using the Fiber Contraction Theorem we prove the existence of $C^1$ solutions of a class of iterative functional equations which involves iterates of the unknown functions and…
Richard Stanley played a crucial role, through his work and his students, in the development of the relatively new area known as combinatorial representation theory. In the early stages, he has the merit to have pointed out to…
We study the principal subspaces, introduced by B. Feigin and A. Stoyanovsky, of the level 1 standard modules for $\hat{\goth{sl}(l+1)}$ with $l \geq 2$. In this paper we construct exact sequences which give us a complete set of recursions…
Christine Tasson introduced an algebraic notion of totality for a denotational model of linear logic in the category of vector spaces. The notion of total boolean function is, in a way, quite intuitive. This note provides a positive answer…
This study introduces a procedure to obtain general expressions, $y = f(x)$, subject to linear constraints on the function and its derivatives defined at specified values. These constrained expressions can be used describe functions with…
Combining a standard proof search method, such as resolution or tableaux, and rewriting is a powerful way to cut off search space in automated theorem proving, but proving the completeness of such combined methods may be challenging. It may…
B. Friedman found in his 1946 paper that the set of analytic univalent functions on the unit disk in the complex plane with integral Taylor coefficients consists of nine functions. In the present paper, we prove that the similar set…
A novel polynomial expansion method of symmetric Boolean functions is described. The method is efficient for symmetric Boolean function with small set of valued numbers and has the linear complexity for elementary symmetric Boolean…
Various feature descriptions are being employed in logic programming languages and constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called features. The descriptions…
In this paper it is shown that the one-dimensional configuration sums of the solvable lattice models of Andrews, Baxter and Forrester and the string functions associated with admissible representations of the affine Lie algebra A$_1^{(1)}$…
By introducing a kind of special functions namely exponent-like function, cosine-like function and sine-like function, we obtain explicitly the basic structures of solutions of initial value problem at the original point for this kind of…
In this paper, the author gives two methods to construct complete Lie algebras. Both methods show that the derivation algebras of some Lie algebras are complete.
We prove a Leibniz rule for BV functions in a complete metric space that is equipped with a doubling measure and supports a Poincar\'e inequality. Unlike in previous versions of the rule, we do not assume the functions to be locally…
We shall work with the so called duality triads following kwa\'sniewski. In particular in this note we propose some extensions of them - hence we choose such special class of triads that admit - all at once - a unified combinatorial…
We propose a new definition of effective formulas for problems in enumerative combinatorics. We outline the proof of the fact that every linear recurrence sequence of integers has such a formula. It follows from a lower bound that can be…
We propose a new approach to the combinatorial interpretations of linearization coefficient problem of orthogonal polynomials. We first establish a difference system and then solve it combinatorially and analytically using the method of…
We present a linear functional calculus with both the safety guarantees expressible with linear types and the rich language of combinators and composition provided by functional programming. Unlike previous combinations of linear typing and…
We attempt to survey the field of combinatorial representation theory, describe the main results and main questions and give an update of its current status. We give a personal viewpoint on the field, while remaining aware that there is…
Freed-Hopkins-Teleman expressed the Verlinde algebra as twisted equivariant K-theory. We study how to recover the full system (fusion algebra of defect lines), nimrep (cylindrical partition function), etc of modular invariant partition…
We explore the Collatz conjecture and its variants through the lens of termination of string rewriting. We construct a rewriting system that simulates the iterated application of the Collatz function on strings corresponding to mixed…