Related papers: New Combinatorial Complete One-Way Functions
This article presents a reformulation of the Theory of Functional Connections: a general methodology for functional interpolation that can embed a set of user-specified linear constraints. The reformulation presented in this paper exploits…
In the early 2000's the first and second named authors worked for a period of six years in an attempt of proving the Compositional Shuffle Conjecture [1]. Their approach was based on the discovery that all the Combinatorial properties…
We examine an identity originally stated in Ramanujan's ``lost notebook'' and first proven algebraically by Andrews and combinatorially by Kim. We give two independent combinatorial proofs and interpretations of this identity, which also…
In a number of papers, Y. Sternfeld investigated the problems of representation of continuous and bounded functions by linear superpositions. In particular, he proved that if such representation holds for continuous functions, then it holds…
The 1-2-3 conjecture has been solved positively in 2024 for finite graphs and by extension for infinite graphs which are locally finite. The solution is non-constructive, and finding explicit solutions for large (or infinite) graphs is very…
In this note, we give a new characterisation of Sobolev $W^{1,1}$ functions among $BV$ functions via Hardy-Littlewood maximal function. Exploiting some ideas coming from the proof of this result, we are also able to give a new…
We show how lattice paths and the reflection principle can be used to give easy proofs of unimodality results. In particular, we give a "one-line" combinatorial proof of the unimodality of the binomial coefficients. Other examples include…
This work applies the ideas of Alekseev and Meinrenken's Non-commutative Chern-Weil Theory to describe a completely combinatorial and constructive proof of the Wheeling Theorem. In this theory, the crux of the proof is, essentially, the…
A representation-theoretic approach to special functions was developed in the 40-s and 50-s in the works of I.M.Gelfand, M.A.Naimark, N.Ya.Vilenkin, and their collaborators. The essence of this approach is the fact that most classical…
We prove that the existence of finite combinatorial objects such as affine planes, mutually orthogonal Latin squares, and resolvable balanced incomplete block designs can be reformulated as the existence of certain algorithmic reductions…
In this article, we introduce a new homotopy function to trace the trajectory by applying modified homotopy continuation method for finding the solution of the linear complementarity problem. Earlier several authors attempted to propose…
We define a generalisation of the completed Riemann zeta function in several complex variables. It satisfies a functional equation, shuffle product identities, and has simple poles along finitely many hyperplanes, with a recursive structure…
We construct a combinatorial model that is described by the cube recurrence, a nonlinear recurrence relation introduced by Propp, which generates families of Laurent polynomials indexed by points in $\mathbb{Z}^3$. In the process, we prove…
We present an extension to the $\mathtt{mathlib}$ library of the Lean theorem prover formalizing the foundations of computability theory. We use primitive recursive functions and partial recursive functions as the main objects of study, and…
We introduce and analyze a novel class of binary operations on finite-dimensional vector spaces over a field K, defined by second-order multilinear expressions with linear shifts. These operations generate polynomials whose degree increases…
New sufficient conditions for representation of a function of several variables as an absolutely convergent Fourier integral are obtained in the paper.
This work is a survey on completely regular codes. Known properties, relations with other combinatorial structures and constructions are stated. The existence problem is also discussed and known results for some particular cases are…
We present a novel way of generating Lyapunov functions for proving linear convergence rates of first-order optimization methods. Our approach provably obtains the fastest linear convergence rate that can be verified by a quadratic Lyapunov…
We introduce a new technique for solving uni-parametric versions of linear programs, convex quadratic programs, and linear complementarity problems in which a single parameter is permitted to be present in any of the input data. We…
Petrie symmetric functions $G(k,n)$, also known as truncated homogeneous symmetric functions or modular complete symmetric functions, form a class of symmetric functions interpolating between the elementary symmetric functions $e_n$ and the…