相关论文: Reduction of Simplicial Complex by Relation and Do…

In many domains we have witnessed the need to search a large entity-relation graph for direct and indirect relationships between a set of entities specified in a query. A search result, called a semantic association (SA), is typically a…

This paper gives a k-means approximation algorithm that is efficient in the relational algorithms model. This is an algorithm that operates directly on a relational database without performing a join to convert it to a matrix whose rows…

In this work, we construct a new data type for hadronic jets in which the traditional point-cloud representation is transformed into a simplicial complex consisting of vertices, or 0-simplexes. An angular resolution scale, $r$, is then…

We give a classification into conjugacy classes of subalgebras of the symmetry algebra generated by the Zabolotskaya-Khokhlov equation, and obtain all similarity reductions of this equation into $(1+1)$-dimensional equations. We thus show…

An efficiency of the Tucker decomposition of amplitude tensors within the single-reference relativistic coupled cluster method with single and double excitations (RCCSD) was studied in a series of benchmark calculations for (AuCl)$_n$…

The branching rules between simple Lie algebras and its regular (maximal) simple subalgebras are studied. Two types of recursion relations for anomalous relative multiplicities are obtained. One of them is proved to be the factorized…

Relation ties, defined as the correlation and mutual exclusion between different relations, are critical for distant supervised relation extraction. Existing approaches model this property by greedily learning local dependencies. However,…

Rips complexes are important structures for analyzing topological features of metric spaces. Unfortunately, generating these complexes is expensive because of a combinatorial explosion in the complex size. For $n$ points in $\mathbb{R}^d$,…

The (prefix-free) Kolmogorov complexity of a finite binary string is the length of the shortest description of the string. This gives rise to some `standard' lowness notions for reals: A is K-trivial if its initial segments have the lowest…

Dictionary learning and component analysis are part of one of the most well-studied and active research fields, at the intersection of signal and image processing, computer vision, and statistical machine learning. In dictionary learning,…

We give new information about the relationship between the low-dimensional homology of a group and its derived series. This yields information about how the low-dimensional homology of a topological space constrains its fundamental group.…

We present multiply subtractive Kramers-Kronig (MSKK) relations for the moments of arbitrary order harmonic generation susceptibility. Using experimental data on third-harmonic wave from polysilane, we show that singly subtractive…

We find families of simplicial complexes where the simplicial chromatic polynomials defined by Cooper--de Silva--Sazdanovic \cite{CdSS} are Hilbert series of Stanley--Reisner rings of auxiliary simplicial complexes. As a result, such…

We demonstrate that the classical Michael selection theorem for l.s.c. mappings with a collectionwise normal domain can be reduced only to compact-valued mappings modulo Dowker's extension theorem for such spaces. The idea used to achieve…

We unify the Kumjian-Renault Weyl groupoid construction with the Lawson-Lenz version of Exel's tight groupoid construction. We do this by utilising only a weak algebraic fragment of the C*-algebra structure, namely its *-semigroup reduct.…

Let $k$ be a perfect field of characteristic $p > 2$, and let $K$ be a finite totally ramified extension over $W(k)[\frac{1}{p}]$. Let $R_0$ be an unramified relative base ring over $W(k)\langle X_1^{\pm 1}, \ldots, X_d^{\pm 1}\rangle$, and…

We introduce a new class of algorithms for finding a short vector in lattices defined by codes of co-dimension $k$ over $\mathbb{Z}_P^d$, where $P$ is prime. The co-dimension $1$ case is solved by exploiting the packing properties of the…

Kim defined a very general combinatorial abstraction of the diameter of polytopes called subset partition graphs to study how certain combinatorial properties of such graphs may be achieved in lower bound constructions. Using Lov\'asz'…

In this paper, we propose an overlapping additive Schwarz method for total variation minimization based on a dual formulation. The $O(1/n)$-energy convergence of the proposed method is proven, where $n$ is the number of iterations. In…

We propose and analyze a second-order Strang splitting method for a class of stiff matrix differential equations with Sylvester-type structure. The method splits the dynamics into a stiff linear part, treated exactly via matrix…