相关论文: An algorithmic approach to Dold-Puppe complexes

Two linear recurrences exhibit mirror symmetry connecting the constants $e$ and $\pi$. When parametrized, their asymptotic connection constants extend to meromorphic functions satisfying additive functional equations with rational…

The following three types of objects are considered in a dual functorial formalism: (i) ind-scheme of mappings between two schemes, (ii) for a quantum group G, ind-scheme of G-mappings between two G-schemes, and (iii) ind-scheme of group…

A subcategory of an abelian category is wide if it is closed under sums, summands, kernels, cokernels, and extensions. Wide subcategories provide a significant interface between representation theory and combinatorics. If $\Phi$ is a finite…

A method of {\it topological grammars} is proposed for multidimensional data approximation. For data with complex topology we define a {\it principal cubic complex} of low dimension and given complexity that gives the best approximation for…

Natural Language Processing (NLP) provides highly effective tools for interpreting and handling human language, offering a broad spectrum of applications. In this paper, we address a classic combinatorial problem -- finding graph partitions…

In fuzzy theory of sets and groups, the use of $\alpha$--levels is a standard to translate problems from the fuzzy to the crisp framework. Using strong $\alpha$--levels, it is possible to establish a one to one correspondence which makes…

This work provides an effective algorithm for distinguishing finite quotients between two non-isomorphic finitely generated Fuchsian groups $\Gamma$ and $\Lambda$. It will suffice to take a finite quotient which is abelian, dihedral, a…

We define a fundamental group for digital images. Namely, we construct a functor from digital images to groups, which closely resembles the ordinary fundamental group from algebraic topology. Our construction differs in several basic ways…

We extend the algorithm of Darmon-Green and Darmon-Pollack for computing p-adic Darmon points on elliptic curves to the case of composite conductor. We also extend the algorithm of Darmon-Logan for computing ATR Darmon points to treat…

This manuscript represents the author's PhD dissertation thesis.The first part studies decision problems in Thompson's groups F,T,V and some generalizations. The simultaneous conjugacy problem is determined to be solvable for Thompson's…

Classification is one of the core problems in Computer-Aided Diagnosis (CAD), targeting for early cancer detection using 3D medical imaging interpretation. High detection sensitivity with desirably low false positive (FP) rate is critical…

Let $\Gamma$ be a simple connected undirected graph with vertex set $V(\Gamma)$ and edge set $E(\Gamma)$. The metric dimension of a graph $\Gamma$ is the least number of vertices in a set with the property that the list of distances from…

For a class of arithmetic subgroups $\Gamma$ in SU(d,1) we prove that for every positive integer $n$ there exists a subgroup $\Gamma_n$ of finite index in $\Gamma$, which lifts to the $n$-fold connected cover of of SU(d,1). Consequently…

The damped Gauss-Newton (dGN) algorithm for CANDECOMP/PARAFAC (CP) decomposition can handle the challenges of collinearity of factors and different magnitudes of factors; nevertheless, for factorization of an $N$-D tensor of size $I_1\times…

A finite simple graph $\Gamma$ determines a quotient $P_\Gamma$ of the pure braid group, called a graphic arrangement group. We analyze homomorphisms of these groups defined by deletion of sets of vertices, using methods developed in prior…

Like bisimulations, simulations and directed simulations are used for analyzing graph-based structures such as automata, labeled transition systems, linked data networks, Kripke models and interpretations in description logic. Simulations…

Let $SGL_n(\mathbb{F}_2)$ be the set of all invertible $n\times n$ symmetric matrices over the binary field $\mathbb{F}_2$. Let $\Gamma_n$ be the graph with the vertex set $SGL_n(\mathbb{F}_2)$ where a pair of matrices $\{A,B\}$ form an…

Many problems in Physics and Chemistry are formulated as the minimization of a functional. Therefore, methods for solving these problems typically require differentiating maps whose input and/or output are functions -- commonly referred to…

Suppose $\Gamma$ is a finite simple graph. If $D$ is a dominating set of $\Gamma$ such that each $x\in D$ is contained in the set of vertices of an odd cycle of $\Gamma$, then we say that $D$ is an odd dominating set for $\Gamma$. For a…

Obtaining reliable estimates of the statistical properties of complex macromolecules by computer simulation is a task that requires high computational effort as well as the development of highly efficient simulation algorithms. We present…