相关论文: Bases in Systems of Simplices and Chambers
The parametrization theorem is derived in a flat nD pseudo-complex affine space. The pseudo-complex hyperbolic space accomodates n-number of uncompactified time-like extra dimensions with sugnature (s,r), where s and r are the numbers of…
In this paper, we will show that the width of simplices defined by systems of linear inequalities can be computed in polynomial time if some minors of their constraint matrices are bounded. Additionally, we present some…
A hypergraph can be obtained from a simplicial complex by deleting some non-maximal simplices. By [11], a hypergraph gives an associated simplicial complex. By [4], the embedded homology of a hypergraph is the homology of the infimum chain…
We investigate numerically efficient approximations of eigenspaces associated to symmetric and general matrices. The eigenspaces are factored into a fixed number of fundamental components that can be efficiently manipulated (we consider…
Let $\Gamma$ be a $T$-ideal of identities of an affine PI-algebra over an algebraically closed field $F$ of characteristic zero. Consider the family $\mathcal{M}_{\Gamma}$ of finite dimensional algebras $\Sigma$ with $Id(\Sigma) = \Gamma$.…
In this paper, we consider a simple class of stratified spaces -- 2-complexes. We present an algorithm that learns the abstract structure of an embedded 2-complex from a point cloud sampled from it. We use tools and inspiration from…
Metric independent $\sigma$ models are constructed. These are field theories which generalise the membrane idea to situations where the target space has fewer dimensions than the base manifold. Instead of reparametrisation invariance of the…
We present a graph-theoretic model for dynamical systems $(X,\sigma)$ given by a surjective local homeomorphism $\sigma$ on a totally disconnected compact metrizable space $X$. In order to make the dynamics appear explicitly in the graph,…
The Sum of Squares (\sos{}) hierarchy gives an automatized technique to create a family of increasingly tight convex relaxations for binary programs. There are several problems for which a constant number of rounds of this hierarchy give…
We computed the actions for the 1D N=5 sigma-models with respect to the two inequivalent (2,8,6) multiplets. 4 supersymmetry generators are manifest, while the constraint originated by imposing the 5-th supersymmetry automatically induces a…
Graph independence (also known as $\epsilon$-independence or $\lambda$-independence) is a mixture of classical independence and free independence corresponding to graph products or groups and operator algebras. Using conjugation by certain…
"Pure" homogeneous linear supermultiplets (minimal and non-minimal) of the N=4-Extended one-dimensional Supersymmetry Algebra are classified. "Pure" means that they admit at least one graphical presentation (the corresponding graph/graphs…
The ordinary generating function of the number of complete subgraphs (cliques) of $G$, denoted by $C(G,x)$, is called the The clique polynomial of the graph $G$. In this paper, we first introduce some \emph{clique} incidence matrices…
In this article we continue to develop the theory of generating symmetries for integrable equations. A technique for computation of generating symmetries using Maple is presented. The technique is based on the standard symmetry method. By…
The moduli space of projective structures on a compact oriented surface $\Sigma$ has a holomorphic symplectic structure, which is constructed by pulling back, using the monodromy map, the Atiyah--Bott--Goldman symplectic form on the…
For any finite graph Gamma and any field K of characteristic unequal to 2 we construct an algebraic variety X over K whose K-points parameterise K-Lie algebras generated by extremal elements, corresponding to the vertices of the graph, with…
We describe a flexible construction that produces triples of finitely generated, residually finite groups $M\hookrightarrow P \hookrightarrow \Gamma$, where the maps induce isomorphisms of profinite completions…
Analyzing embedded simplicial complexes, such as triangular meshes and graphs, is an important problem in many fields. We propose a new approach for analyzing embedded simplicial complexes in a subdivision-invariant and isometry-invariant…
Let $\Gamma$ be a subgroup of $PSL(2,R)$ generated by three parabolic transformations. The main goal of this paper is to present an algorithm to determine whether or not $\Gamma$ is discrete. Historically discreteness algorithms have been…
Given free modules $M\subseteq L$ of finite rank $f\geq 1$ over a principal ideal domain $R$, we give a procedure to construct a basis of $L$ from a basis of $M$ assuming the invariant factors or elementary divisors of $L/M$ are known.…