Related papers: The Redei-Berge function in noncommuting variables
We show that the graph of a bent function is a Salem set in an appropriate sense. We also establish a simple result that quantifies redundancies in the difference operators of a function, which applies to bent functions over fields of odd…
Examples of discontinuous functions already appear in the work of Euler, Abel, Dirichlet, Fourier, and Bolzano. A ground-breaking discovery due to Baire was that many discontinuous functions are well-behaved in that they are the pointwise…
Rochberg's coboundary theorem provides conditions under which the equation $(I-T)y = x$ is solvable in $y$. Here $T$ is a unilateral shift on Hilbert space, $I$ is the identity operator and $x$ is a given vector. The conditions are…
In this paper, we establish a new zeta function based on the Bartholdi zeta function for an undirected graph G called the reduced Bartholdi zeta function. We study the relation between its coefficients and the structure of the graph, and…
A non-negative function f, defined on the real line or on a half-line, is said to be directly Riemann integrable (d.R.i.) if the upper and lower Riemann sums of f over the whole (unbounded) domain converge to the same finite limit, as the…
We give a survey of selected topics in noncommutative geometry, with some emphasis on those directly related to physics, including our recent work with Dirk Kreimer on renormalization and the Riemann-Hilbert problem. We discuss at length…
Some 15 years ago M. Kontsevich and A. Rosenberg [KR] proposed a heuristic principle according to which the family of schemes ${Rep_n(A)}$ parametrizing the finite-dimensional represen- tations of a noncommutative algebra A should be…
This is a substantially generalized version of the preprint arXiv:1105.4214 by Lifshits and Tyurin. We prove that for any pair of i.i.d. random vectors $X, Y$ in $R^n$ and any real-valued continuous negative definite function $g: R^n\to R$…
We prove new properties of the non-backtracking graph and the non-backtracking Laplacian for graphs. In particular, among other results, we prove that two simple graphs are isomorphic if and only if their corresponding non-backtracking…
We introduce characteristic functions for certain contractive liftings of row contractions. These are multi-analytic operators which classify the liftings up to unitary equivalence and provide a kind of functional model. The most important…
We construct a generalization of the theory of symmetric functions involving functions of commuting and anticommuting (Grassmannian) variables. These new functions, called symmetric functions in superspace, are invariant under the diagonal…
The noncommutative symmetric functions $\textbf{NSym}$ were first defined abstractly by Gelfand et al. in 1995 as the free associative algebra generated by noncommuting indeterminants $\{\boldsymbol{e}_n\}_{n\in \mathbb{N}}$ that were taken…
We introduce a discrete dynamical system on the integers, defined by moving a composite $m$ forward to $m+\pi(m)$ and a prime $p$ backward to $p-\mathrm{prevprime}(p)$. This map produces trajectories whose contraction properties are closely…
In this work we introduce a family of transformations, named \textit{divergence transformations}, interpolating between any pair of probability density functions sharing the same support. We prove the remarkable property that the whole…
We propose two possible definitions for a version of Kemeny's constant of a graph based on non-backtracking random walks (in place of the usual simple random walk). We show that these two definitions coincide for edge-transitive graphs, and…
A symmetric function of $N$ variables can be given in terms of symmetric polynomials of these variables. We determine those symmetric polynomials in which the dual differential operators take the neatest form when expressed in terms of our…
We put forward the concept of measure graphs. These are (possibly uncountable) graphs equipped with an action of a groupoid and a measure invariant under this action. Examples include finite graphs, periodic graphs, graphings and…
We show that certain determinantal functions of multiple matrices, when summed over the symmetries of the cube, decompose into functions of the original matrices. These are shown to be true in complete generality; that is, no properties of…
A well-known open problem in graph theory asks whether Stanley's chromatic symmetric function, a generalization of the chromatic polynomial of a graph, distinguishes between any two non-isomorphic trees. Previous work has proven the…
We define a new family of symmetric functions which are affine analogues of Stanley symmetric functions. We establish basic properties of these functions including symmetry, dominance and conjugation. We conjecture certain positivity…