English
Related papers

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

200 papers

An iterated function system $\Phi$ consisting of contractive similarity mappings has a unique attractor $F \subseteq \mathbb{R}^d$ which is invariant under the action of the system, as was shown by Hutchinson [Hut]. This paper shows how the…

Metric Geometry · Mathematics 2010-07-30 Erin P. J. Pearse

Winfree's abstract Tile Assembly Model (aTAM) is a model of molecular self-assembly of DNA complexes known as tiles, which float freely in solution and attach one at a time to a growing "seed" assembly based on specific binding sites on…

Computational Complexity · Computer Science 2015-03-17 Ho-Lin Chen , David Doty , Shinnosuke Seki

Considering finite extensions K[A] \subseteq K[B] of positive affine semigroup rings over a field K we have developed in [1] an algorithm to decompose K[B] as a direct sum of monomial ideals in K[A]. By computing the regularity of…

Commutative Algebra · Mathematics 2013-09-24 Janko Boehm , David Eisenbud , Max Joachim Nitsche

We consider a class of planar self-affine sets which we call "box-like". A box-like self-affine set is the attractor of an iterated function system (IFS) of affine maps where the image of the unit square, [0,1]^2, under arbitrary…

Metric Geometry · Mathematics 2015-05-30 Jonathan M. Fraser

We present an effective method for computing parametric primary decomposition via comprehensive Gr\"obner systems. In general, it is very difficult to compute a parametric primary decomposition of a given ideal in the polynomial ring with…

Symbolic Computation · Computer Science 2024-08-29 Yuki Ishihara , Kazuhiro Yokoyama

We introduce and study a notion of decomposition of planar point sets (or rather of their chirotopes) as trees decorated by smaller chirotopes. This decomposition is based on the concept of mutually avoiding sets (which we rephrase as…

Computational Geometry · Computer Science 2024-06-12 Mathilde Bouvel , Valentin Féray , Xavier Goaoc , Florent Koechlin

We consider an $\ell_1$-regularized inverse problem where both the forward and regularization operators have a Kronecker product structure. By leveraging this structure, a joint decomposition can be obtained using generalized singular value…

Numerical Analysis · Mathematics 2024-09-04 Brian Sweeney , Malena I. Español , Rosemary Renaut

Let W be a Weyl group, presented as a crystallographic reflection group on a Euclidean vector space V, and C an open Weyl chamber. In a recent paper, Waldspurger proved that the images (id-w)(C), for Weyl group elements w, are all disjoint,…

Group Theory · Mathematics 2011-10-10 Eckhard Meinrenken

Denoising is a fundamental imaging problem. Versatile but fast filtering has been demanded for mobile camera systems. We present an approach to multiscale filtering which allows real-time applications on low-powered devices. The key idea is…

Computer Vision and Pattern Recognition · Computer Science 2018-02-20 Sungjoon Choi , John Isidoro , Pascal Getreuer , Peyman Milanfar

This paper studies separating invariants of finite groups acting on affine varieties through automorphisms. Several results, proved by Serre, Dufresne, Kac-Watanabe and Gordeev, and Jeffries and Dufresne exist that relate properties of the…

Commutative Algebra · Mathematics 2017-04-14 Fabian Reimers

Trimming is a ubiquitous operation in computer-aided-design whereby parts of a geometry are merged, intersected, or simply discarded. While it grants virtually unlimited flexibility in geometric design, it introduces a plethora of other…

Numerical Analysis · Mathematics 2026-04-15 Yannis Voet , Matthias Möller , Pablo Antolin , Cornelis Vuik

Let $H$ be a fixed graph. A {\em fractional $H$-decomposition} of a graph $G$ is an assignment of nonnegative real weights to the copies of $H$ in $G$ such that for each $e \in E(G)$, the sum of the weights of copies of $H$ containing $e$…

Combinatorics · Mathematics 2007-05-23 Raphael Yuster

In this paper we describe an elimination process which is a deterministic rewriting procedure that on each elementary step transforms one system of equations over free groups into a finitely many new ones. Infinite branches of this process…

Group Theory · Mathematics 2007-05-23 Olga Kharlampovich , Alexei Myasnikov

This paper considers the minimization problem of relaxed submodular functions. For a positive integer $k$, a set function is called $k$-distant submodular if the submodular inequality holds for every pair whose symmetric difference is at…

Combinatorics · Mathematics 2025-02-06 Ryuhei Mizutani

We study a nonlinear decomposition of a positive definite matrix into two components: the inverse of another positive definite matrix and a symmetric matrix constrained to lie in a prescribed linear subspace. Equivalently, the inverse…

Optimization and Control · Mathematics 2026-01-27 Yan Dolinsky , Or Zuk

We count subrings of small index of $\mathbb{Z}^n$, where the addition and multiplication are defined componentwise. Let $f_n(k)$ denote the number of subrings of index $k$. For any $n$, we give a formula for this quantity for all integers…

Combinatorics · Mathematics 2022-01-25 Stanislav Atanasov , Nathan Kaplan , Benjamin Krakoff , Julia Menzel

A long-investigated problem in circuit complexity theory is to decompose an $n$-input or $n$-variable Majority Boolean function (call it $M_n$) using $k$-input ones ($M_k$), $k < n$, where the objective is to achieve the decomposition using…

Logic in Computer Science · Computer Science 2025-04-07 Anupam Chattopadhyay , Debjyoti Bhattacharjee , Subhamoy Maitra

The prediction of the quasi-static response of industrial laminate structures requires to use fine descriptions of the material, especially when debonding is involved. Even when modeled at the mesoscale, the computation of these structures…

Computational Physics · Physics 2011-09-29 Pierre Kerfriden , Olivier Allix , Pierre Gosselet

A natural and important generalization of submodularity -- $k$-submodularity -- applies to set functions with $k$ arguments and appears in a broad range of applications, such as infrastructure design, machine learning, and healthcare. In…

Optimization and Control · Mathematics 2021-06-29 Qimeng Yu , Simge Küçükyavuz

We review some recent results related to the self-assembly of infinite structures in the Tile Assembly Model. These results include impossibility results, as well as novel tile assembly systems in which shapes and patterns that represent…

Computational Complexity · Computer Science 2009-06-19 Matthew J. Patitz , Scott M. Summers