Related papers: Bases in Systems of Simplices and Chambers

This paper deals with certain fundamental results about affine hulls and simplices in a real normed linear space. The framework of the paper is Bishop's constructive mathematics, which, with its characteristic interpretation of existence as…

We illustrate a physical situation in which topological symmetry, its breakdown, space-time uncertainty principle, and background independence may play an important role in constructing and understanding matrix models. First, we show that…

In this paper, we derive nearly tight probabilistic norm bounds for a class of random matrices we call graph matrices. While the classical case of symmetric matrices with independent random entries (Wigner's matrices) is a special case, in…

Let $\Sigma$ be a closed surface, $G$ a compact Lie group, with Lie algebra $g$, $\xi \colon P \to \Sigma$ a principal $G$-bundle, let $N(\xi)$ denote the moduli space of central Yang-Mills connections on $\xi$, for suitably chosen…

Sphere-bases are constructed for the $\mathbb{Z}_2$ vector space formed by the $k$-dimensional subcomplexes, of $n$-simplex (or $n$-cube), for which every $(k{-}1)$-face is contained in a positive even number of $k$-cells; addition is…

Fix $c\in (0,1)$ and let $\Gamma$ be a $\lfloor c n\rfloor$-regular digraph on $n$ vertices drawn uniformly at random. We prove that when $n$ is large, the (non-symmetric) adjacency matrix $M$ of $\Gamma$ is invertible with high…

A parameterised Boolean equation system (PBES) is a set of equations that defines sets satisfying the equations as the least and/or greatest fixed-points. Thus this system is regarded as a declarative program defining predicates, where a…

Functions of one or more variables are usually approximated with a basis: a complete, linearly-independent system of functions that spans a suitable function space. The topic of this paper is the numerical approximation of functions using…

The O(n) non-linear $\sigma$-model is simulated on 2-dimensional regular and random lattices. We use two different levels of randomness in the construction of the random lattices and give a detailed explanation of the geometry of such…

For a class of $*$-algebras, where $*$-algebra $A_{\Gamma,\tau}$ is generated by projections associated with vertices of graph $\Gamma$ and depends on a parameter $\tau$ $(0 < \tau \leq 1)$, we study the sets $\Sigma_\Gamma$ of values of…

An $n \times n$ matrix with $\pm 1$ entries which acts on $\mathbb{R}^n$ as a scaled isometry is called Hadamard. Such matrices exist in some, but not all dimensions. Combining number-theoretic and probabilistic tools we construct matrices…

Let G be a connected complex simple Lie group with maximal compact subgroup U. Let g be the Lie algebra of G, and X = G/U be the associated Riemannian globally symmetric space of type IV. We have constructed three types of arithmetic…

In this paper, we study structure theorems of algebras of symmetric functions. Based on a certain relation on elementary symmetric polynomials generating such algebras, we consider perturbation in the algebras. In particular, we understand…

The collection of $d \times N$ complex matrices with prescribed column norms and prescribed (nonzero) singular values forms a compact algebraic variety, which we refer to as a frame space. Elements of frame spaces -- i.e., frames -- are…

Let G be the automorphism group of a regular right-angled building X. The "standard uniform lattice" \Gamma_0 in G is a canonical graph product of finite groups, which acts discretely on X with quotient a chamber. We prove that the…

We give a systematic and self-contained account of the construction of geometrically decomposed bases and degrees of freedom in finite element exterior calculus. In particular, we elaborate upon a previously overlooked basis for one of the…

Graph is an abstract representation commonly used to model networked systems and structure. In problems across various fields, including computer vision and pattern recognition, and neuroscience, graphs are often brought into comparison (a…

We present an encoding of a polynomial system into vanishing and non-vanishing constraints on almost-principal minors of a symmetric, principally regular matrix, such that the solvability of the system over some field is equivalent to the…

We introduce an algorithm for computing closure systems derived from a family of implications on a set. Semilattices presentations are explored and used in conjunction with the algorithm to compute various types of lattices freely generated…

The conjugation action of the complex orthogonal group on the polynomial functions on $n \times n$ matrices gives rise to a graded algebra of invariant polynomials. A spanning set of this algebra is in bijective correspondence to a set of…