Related papers: New Combinatorial Complete One-Way Functions
In 2002, Littlejohn and Wellman developed a celebrated general left-definite theory for semi-bounded self-adjoint operators with many applications to differential operators. The theory starts with a semi-bounded self-adjoint operator and…
The problem of optimizing a linear objective function,given a number of linear constraints has been a long standing problem ever since the times of Kantorovich, Dantzig and von Neuman. These developments have been followed by a different…
A partial algebra construction of Gr\"atzer and Schmidt from "Characterizations of congruence lattices of abstract algebras" (Acta Sci. Math. (Szeged) 24 (1963), 34-59) is adapted to provide an alternative proof to a well-known fact that…
A Gauss-Lucas theorem is proved for multivariate entire functions, using a natural notion of separate convexity to obtain sharp results. Previous work in this area is mostly restricted to univariate entire functions (of genus no greater…
A piecewise linear function can be described in different forms: as an arbitrarily nested expression of $\min$- and $\max$-functions, as a difference of two convex piecewise linear functions, or as a linear combination of maxima of…
New sequences of orthogonal polynomials with ultra-exponential weight functions are discovered. In particular, it gives an explicit solution to the Ditkin-Prudnikov problem (1966). The 3-term recurrence relations, explicit representations,…
Following the general strategy proposed by G.Rybnikov, we present a proof of his well-known result, that is, the existence of two arrangements of lines having the same combinatorial type, but non-isomorphic fundamental groups. To do so, the…
We prove new necessary and sufficient conditions to carry out a compact linearization approach for a general class of binary quadratic problems subject to assignment constraints as it has been proposed by Liberti in 2007. The new conditions…
We consider the scenario in which a set of sources generate messages in a network and a receiver node demands an arbitrary linear function of these messages. We formulate an algebraic test to determine whether an arbitrary network can…
In the paper we consider a realization of a finite dimensional irreducible representation of the Lie algebra $\mathfrak{gl}_n$ in the space of functions on the group $GL_n$. It is proved that functions corresponding to Gelfand-Tsetlin…
We present a new method for completing higher derivative corrections for theories that exhibit duality symmetries under reduction. This proposal is based on the observation that duality symmetry in the reduced theory highly constrains the…
A simple way to generate a Boolean function is to take the sign of a real polynomial in $n$ variables. Such Boolean functions are called polynomial threshold functions. How many low-degree polynomial threshold functions are there? The…
In this note I present a readable version of the proof of my 2001 result, giving a sufficient and necessary condition for a function on a combinatorial cube to essentially (locally) depend on at most one variable (see the end of the paper…
The purpose of this paper is to clarify the relationship between various conditions implying essential undecidability: our main result is that there exists a theory $T$ in which all partially recursive functions are representable, yet $T$…
We describe recent work of Kim in arXiv:1210.5190 to show that operator convex functions associated with quasi-entropies can be used to prove a large class of new matrix inequalities in the tri-partite and bi-partite setting by taking a…
We give a combinatorial extension of the classical inequalities of Maclaurin about symmetric functions of several variables. We discuss two problems - one analytical and another combinatorial - and show that they are in some sense…
We consider functions of natural numbers which allow a combinatorial interpretation as density functions (speed) of classes of relational structures, s uch as Fibonacci numbers, Bell numbers, Catalan numbers and the like. Many of these…
Zhiwei Yun and Wei Zhang introduced the notion of "super-positivity of self dual L-functions" which specifies that all derivatives of the completed L-function (including Gamma factors and power of the conductor) at the central value $s =…
We generalize the shuffle theorem and its $(km,kn)$ version, as conjectured by Haglund et al. and Bergeron et al., and proven by Carlsson and Mellit, and Mellit, respectively. In our version the $(km,kn)$ Dyck paths on the combinatorial…
We study the following combinatorial version of the Slepian-Wolf coding scheme. Two isolated Senders are given binary strings $X$ and $Y$ respectively; the length of each string is equal to $n$, and the Hamming distance between the strings…