Related papers: Complexity of the Fourier transform on the Johnson…

To a singular knot K with n double points, one can associate a chord diagram with n chords. A chord diagram can also be understood as a 4-regular graph endowed with an oriented Euler circuit. L. Traldi introduced a polynomial invariant for…

The question of matrix similarity is a classical one in linear algebra. For a field $\mathbb{F}$ and some positive integer $n \in \mathbb{N}$, one may consider the following problems: 1. Given two matrices $A, B \in \mathrm{GL}(n,…

Let $G$ be an even orthogonal quasi-split group defined over a local non-archimedean field $F$. We describe the subspace of smooth vectors of the minimal representation of $G(F),$ realized on the space of square-integrable functions on a…

Newton iteration (NI) is an almost 350 years old recursive formula that approximates a simple root of a polynomial quite rapidly. We generalize it to a matrix recurrence (allRootsNI) that approximates all the roots simultaneously. In this…

Given a holomorphic iterated function scheme with a finite symmetry group $G$, we show that the associated dynamical zeta function factorizes into symmetry-reduced analytic zeta functions that are parametrized by the unitary irreducible…

Modular operads are a special type of operad: in fact, they bear the same relationship to operads that graphs do to trees (i.e. simply connected graphs). One of the basic examples of a modular operad is the collection of…

We focus on functional renormalization for ensembles of several (say $n\geq 1$) random matrices, whose potentials include multi-traces, to wit, the probability measure contains factors of the form $ \exp[-\mathrm{Tr}(V_1)\times\ldots\times…

A general and fast method is conceived for computing the cyclic convolution of n points, where n is a prime number. This method fully exploits the internal structure of the cyclic matrix, and hence leads to significant reduction of the…

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…

Normalized irreducible characters of the symmetric group S(n) can be understood as zonal spherical functions of the Gelfand pair $(S(n)\times S(n),\Diag S(n))$. They form an orthogonal basis in the space of the functions on the group S(n)…

In this paper we construct the supersymmetric tensor hierarchy of N=1, d=4 supergravity. We find some differences with the general bosonic construction of 4-dimensional gauged supergravities. The global symmetry group of N=1,d=4…

We consider the gl(N)-invariant Calogero-Sutherland Models with N=1,2,3,... in a unified framework, which is the framework of Symmetric Polynomials. By the framework we mean an isomorphism between the space of states of the gl(N)-invariant…

A $[k,n,1]$-graph is a $k$-partite graph with parts of order $n$ such that the bipartite graph induced by any pair of parts is a matching. An independent transversal in such a graph is an independent set that intersects each part in a…

The Jacobson Coordinatization Theorem describes the structure of unitary Jordan algebras containing the algebra $H_n(F)$ of symmetric nxn matrices over a field F with the same identity element, for $n\geq 3$. In this paper we extend the…

Based on Stokes' theorem we derive a non-holomorphic functional calculus for matrices, assuming sufficient smoothness near eigenvalues, corresponding to the size of related Jordan blocks. It is then applied to the complex conjugation…

We investigate the renormalization group theory of generalized multi-vertex sine-Gordon model by employing the dimensional regularization method and also the Wilson renormalization group method. The vertex interaction is given by…

An automorphism of a graph $G$ with $n$ vertices is a bijective map $\phi$ from $V(G)$ to itself such that $\phi(v_i)\phi(v_j)\in E(G)$ $\Leftrightarrow$ $v_i v_j\in E(G)$ for any two vertices $v_i$ and $v_j$ of $G$. Denote by…

This thesis concerns the study of homogeneous factorisations of complete graphs with edge-transitive factors. A factorisation of a complete graph $K_n$ is a partition of its edges into disjoint classes. Each class of edges in a…

Obtaining a non-trivial (super-linear) lower bound for computation of the Fourier transform in the linear circuit model has been a long standing open problem. All lower bounds so far have made strong restrictions on the computational model.…

We define an abelian group homomorphism $\mathscr{F}$, which we call the Frobenius transform, from the ring of symmetric functions to the ring of the symmetric power series. The matrix entries of $\mathscr{F}$ in the Schur basis are the…