Related papers: Computing the Dimension of a Bipartition Matrix
This paper introduces two matrix analogues for set partitions. A composition matrix on a finite set X is an upper triangular matrix whose entries partition X, and for which there are no rows or columns containing only empty sets. A…
Fractal sets, by definition, are non-differentiable, however their dimension can be continuous, differentiable, and arithmetically manipulable as function of their construction parameters. A new arithmetic for fractal dimension of polyadic…
We propose a systematic approach to calculating $n$-point one-loop parametric conformal integrals in $D$ dimensions which we call the reconstruction procedure. It relies on decomposing a conformal integral over basis functions which are…
We consider the dimensions of finite type of representations of a partially ordered set, i.e. such that there is only finitely many isomorphism classes of representations of this dimension. We give a criterion for a dimension to be of…
A computable ring is a ring equipped with mechanical procedure to add and multiply elements. In most natural computable integral domains, there is a computational procedure to determine if a given element is prime/irreducible. However,…
A numerical irreducible decomposition for a polynomial system provides representations for the irreducible factors of all positive dimensional solution sets of the system, separated from its isolated solutions. Homotopy continuation methods…
A \emph{fractal} is an object exhibiting complexity at arbitrarily small scales. In order to study and characterise fractals, one is often interested in quantifying how they fill up space on small scales. This gives rise to various notions…
The study of the combinatorial diameter of a polyhedron is a classical topic in linear-programming theory due to its close connection with the possibility of a polynomial simplex-method pivot rule. The 2-sum operation is a classical…
Finite dimensional linear spaces (both complex and real) with indefinite scalar product [.,.] are considered. Upper and lower bounds are given for the size of an indecomposable matrix that is normal with respect to this scalar product in…
A matrix $T \in \M_n(\C)$ is \emph{UECSM} if it is unitarily equivalent to a complex symmetric (i.e., self-transpose) matrix. We develop several techniques for studying this property in dimensions three and four. Among other things, we…
Non-autonomous iterated function systems are a generalization of iterated function systems. If the contractions in the system are conformal mappings, it is called a non-autonomous conformal iterated function system, and its attractor is…
Under the name prime decomposition (pd), a unique decomposition of an arbitrary $N$-dimensional density matrix $\rho$ into a sum of seperable density matrices with dimensions given by the coprime factors of $N$ is introduced. For a class of…
We give an overview of recent developments in the computation of the anomalous dimension matrix of composite operators in non-forward kinematics. The elements of this matrix determine the scale dependence of non-perturbative parton…
We investigate the representation of symmetric polynomials as a sum of squares. Since this task is solved using semidefinite programming tools we explore the geometric, algebraic, and computational implications of the presence of discrete…
Every square matrix $A=(a_{uv})\in \mathcal{C}^{n\times n}$ can be represented as a digraph having $n$ vertices. In the digraph, a block (or 2-connected component) is a maximally connected subdigraph that has no cut-vertex. The determinant…
We construct the quaternion algebra [10] "geometrically" by a three dimensional analogue of the classic two dimensional geometric description of the complex field. The algebraic description of the multiplication operation in three…
Computation of the interleaving distance between persistence modules is a central task in topological data analysis. For $1$-parameter persistence modules, thanks to the isometry theorem, this can be done by computing the bottleneck…
The form factor of a quantum graph is a function measuring correlations within the spectrum of the graph. It can be expressed as a double sum over the periodic orbits on the graph. We propose a scheme which allows one to evaluate the…
We provide exact and asymptotic formulae for the number of unrestricted, respectively indecomposable, $d$-dimensional matrices where the sum of all matrix entries with one coordinate fixed equals 2.
The two-dimensional one-component plasma ---2dOCP--- is a system composed by $n$ mobile particles with charge $q$ over a neutralizing background in a two-dimensional surface. The Boltzmann factor of this system, at temperature $T$, takes…