English
Related papers

Related papers: Decomposition of Integral Self-Affine Multi-Tiles

200 papers

The Hilbert scheme of $n$ points in the affine plane contains the open subscheme parametrizing $n$ distinct points in the affine plane, and the closed subscheme parametrizing ideals of codimension $n$ supported at the origin of the affine…

Algebraic Geometry · Mathematics 2014-07-03 Mathias Lederer

We develop an iterative refinement method that improves the accuracy of a user-chosen subset of $k$ eigenvectors ($k\ll n$) of an $n\times n$ real symmetric matrix. Using an orthogonal matrix represented in compact WY form, the method…

Numerical Analysis · Mathematics 2026-03-02 Takeshi Terao , Katsuhisa Ozaki , Toshiyuki Imamura , Takeshi Ogita

Patterned self-assembly tile set synthesis (PATS) aims at finding a minimum tile set to uniquely self-assemble a given rectangular color pattern. For $k \ge 1$, $k$-PATS is a variant of PATS that restricts input patterns to those with at…

Computational Complexity · Computer Science 2014-04-14 Aleck C. Johnsen , Ming-Yang Kao , Shinnosuke Seki

An irreducible algebraic decomposition $\cup_{i=0}^{d}X_i=\cup_{i=0}^{d} (\cup_{j=1}^{d_i}X_{ij})$ of an affine algebraic variety X can be represented as an union of finite disjoint sets $\cup_{i=0}^{d}W_i=\cup_{i=0}…

Algebraic Geometry · Mathematics 2010-10-18 Shawki Al-Rashed , Gerhard Pfister

We study the structure of the set of all possible affine hyperplane sections of a convex polytope. We present two different cell decompositions of this set, induced by hyperplane arrangements. Using our decomposition, we bound the number of…

Combinatorics · Mathematics 2025-06-02 Marie-Charlotte Brandenburg , Jesús A. De Loera , Chiara Meroni

To solve the issue of segmenting rich texture images, a novel detection methods based on the affine invariable principle is proposed. Considering the similarity between the texture areas, we first take the affine transform to get numerous…

Image and Video Processing · Electrical Eng. & Systems 2017-12-27 Jianwei Zhang , Xu Chen , Xuezhong Xiao

We present a novel algorithm for performing the Cartan-Khaneja-Glaser decomposition of unitary matrices in $SU(2^n)$, a critical task for efficient quantum circuit design. Building upon the approach introduced by S\'a Earp and Pachos…

Reliable control of the deposition process of optical films and coatings frequently requires monitoring of the refractive index profile throughout the layer. In the present work a simple in situ approach is proposed which uses a WKBJ matrix…

Optics · Physics 2009-10-31 Daniel Poitras , Ludvik Martinu

The ability to design and synthesize ever more complicated colloidal particles opens the possibility of self-assembling a zoo of complex structures, including those with one or more self-limited length scales. An undesirable feature of…

Soft Condensed Matter · Physics 2022-03-02 Thomas E. Videbæk , Huang Fang , Daichi Hayakawa , Botond Tyukodi , Michael F. Hagan , W. Benjamin Rogers

In the present note we suggest an affinization of a theorem by Kostrikin et.al. about the decomposition of some complex simple Lie algebras ${\cal G}$ into the algebraic sum of pairwise orthogonal Cartan subalgebras. We point out that the…

High Energy Physics - Theory · Physics 2009-10-28 L. A. Ferreira , D. I. Olive , M. V. Saveliev

Consider rings of single variable real analytic or complex entire functions, denoted by $\mathbb{K}\langle z\rangle$. We study "discrete $z$-filters" on $\mathbb{K}$ and their connections with the space of maximal ideals of…

General Topology · Mathematics 2016-07-19 Bedanta Bose , Mayukh Mukherjee

In practice, non-specialized interior point algorithms often cannot utilize the massively parallel compute resources offered by modern many- and multi-core compute platforms. However, efficient distributed solution techniques are required,…

Optimization and Control · Mathematics 2026-04-10 Nils-Christian Kempke , Daniel Rehfeldt , Thorsten Koch

Recently, triple decomposition has attracted increasing attention for decomposing third-order tensors into three factor tensors. However, this approach is limited to third-order tensors and enforces uniformity in the lower dimensions across…

Numerical Analysis · Mathematics 2025-11-14 Kunjing Yang , Libin Zheng , Minru Bai

We introduce a new property of tile self-assembly systems that we call size-separability. A system is size-separable if every terminal assembly is a constant factor larger than any intermediate assembly. Size-separability is motivated by…

Computational Geometry · Computer Science 2014-04-30 Andrew Winslow

The proposed work aims at proposing a alternative kernel decomposition in the context of kernel machines with indefinite kernels. The original paper of KSVM (SVM in Kre\v{i}n spaces) uses the eigen-decomposition, our proposition avoids this…

Machine Learning · Computer Science 2019-02-28 Gaëlle Loosli

We consider the problem of low-rank decomposition of incomplete multiway tensors. Since many real-world data lie on an intrinsically low dimensional subspace, tensor low-rank decomposition with missing entries has applications in many data…

Numerical Analysis · Computer Science 2016-08-24 Linxiao Yang , Jun Fang , Hongbin Li , Bing Zeng

Regular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of polynomial systems. This paper proposes adaptations of these tools focusing on solutions of the real analogue:…

Symbolic Computation · Computer Science 2010-05-17 Changbo Chen , James H. Davenport , John P. May , Marc Moreno Maza , Bican Xia , Rong Xiao

Let K be a self-similar or self-affine set in R^d, let \mu be a self-similar or self-affine measure on it, and let G be the group of affine maps, similitudes, isometries or translations of R^d. Under various assumptions (such as separation…

General Mathematics · Mathematics 2008-07-14 Márton Elekes , Tamás Keleti , András Máthé

The profinite completion of the fundamental group of a closed, orientable $3$-manifold determines the Kneser--Milnor decomposition. If $M$ is irreducible, then the profinite completion determines the Jaco--Shalen--Johannson decomposition of…

Group Theory · Mathematics 2019-02-20 Henry Wilton , Pavel Zalesskii

The aim of this work is to show how we can decompose a module (if decomposable) into an indecomposable module with the help of the minimization process.

Symbolic Computation · Computer Science 2016-08-31 Gerard Duchamp , Hatem Hadj Kacem , Eric Laugerotte