English
Related papers

Related papers: Canonical projection tilings defined by patterns

200 papers

Bounded linear types have proved to be useful for automated resource analysis and control in functional programming languages. In this paper we introduce an affine bounded linear typing discipline on a general notion of resource which can…

Programming Languages · Computer Science 2013-07-10 Dan R. Ghica , Alex Smith

Icosahedral tilings, although non-periodic, are known to be characterized by their configurations of some finite size. This characterization has also been expressed in terms of a simple alternation condition. We provide an alternative proof…

Combinatorics · Mathematics 2016-08-16 Nicolas Bédaride , Thomas Fernique

We consider several characterizations of $\mathbb R$-linear mappings. In particular, we give a characterization of linear mappings whose range is $\geq$ 2 dimensional, in terms of preservation of lines (and contraction of lines to a point)…

General Mathematics · Mathematics 2020-08-06 Sakaé Fuchino

If most of the pixels in an $n \times m$ digital image are the same color, must the image contain a large connected component? How densely can a given set of connected components pack in $\mathbb{Z}^2$ without touching? We answer these two…

Combinatorics · Mathematics 2025-12-15 Kyle Fridberg

We study infinite dimensional tilting modules over a concealed canonical algebra of domestic or tubular type. In the domestic case, such tilting modules are constructed by using the technique of universal localization, and they can be…

Representation Theory · Mathematics 2019-11-07 Lidia Angeleri Hügel , Dirk Kussin

Typestate systems ensure many desirable properties of imperative programs, including initialization of object fields and correct use of stateful library interfaces. Abstract sets with cardinality constraints naturally generalize typestate…

Programming Languages · Computer Science 2013-02-14 Bruno Marnette , Viktor Kuncak , Martin Rinard

We study the problem of binary composite channel discrimination in the asymmetric setting, where the hypotheses are given by fairly arbitrary sets of channels, and samples do not have to be identically distributed. In the case of quantum…

Quantum Physics · Physics 2025-09-17 Bjarne Bergh , Nilanjana Datta , Robert Salzmann

A basic problem in the study of algebraic morphisms is to determine which sets can be realised as the image of an endomorphism of affine space. This paper extends the results previously obtained by the first author on the question of…

Algebraic Geometry · Mathematics 2023-11-15 Viktor Balch Barth , Tuyen Trung Truong

Let $F$ be a field, let $D$ be a subring of $F$, and let ${\mathfrak{X}}$ be the Zariski-Riemann space of valuation rings containing $D$ and having quotient field $F$. We consider the Zariski, inverse and patch topologies on…

Commutative Algebra · Mathematics 2014-09-18 Bruce Olberding

Narrowing and unification are very useful tools for symbolic analysis of rewrite theories, and thus for any model that can be specified in that way. A very clear example of their application is the field of formal cryptographic protocol…

Symbolic Computation · Computer Science 2023-07-14 Raúl López-Rueda , Santiago Escobar , Julia Sapiña

We discuss the isomorphism problem of projective schemes; given two projective schemes, can we algorithmically decide whether they are isomorphic? We give affirmative answers in the case of one-dimensional projective schemes, the case of…

Algebraic Geometry · Mathematics 2024-02-27 Takehiko Yasuda

We present certain existence criteria and parameterisations for an interpolation problem for completely positive maps that take given matrices from a finite set into prescribed matrices. Our approach uses density matrices associated to…

Operator Algebras · Mathematics 2013-09-03 Calin-Grigore Ambrozie , Aurelian Gheondea

Affine Cartesian codes are defined by evaluating multivariate polynomials at a cartesian product of finite subsets of a finite field. In this work we examine properties of these codes as batch codes. We consider the recovery sets to be…

Information Theory · Computer Science 2020-05-18 Travis Baumbaugh , Haley Colgate , Timothy Jackman , Felice Manganiello

A quantization over a manifold can be seen as a way to construct a differential operator with prescribed principal symbol. The quantization map is moreover required to be a linear bijection. It is known that there is in general no natural…

Differential Geometry · Mathematics 2008-11-25 Pierre Mathonet , Fabian Radoux

Pattern-matching programming is an example of a rule-based programming style developed in functional languages. This programming style is intensively used in dialects of ML but is restricted to algebraic data-types. This restriction limits…

Programming Languages · Computer Science 2009-12-25 Julien Cohen

We study the space of all tilings which can be obtained using the Robinson tiles (this is a two-dimensional subshift of finite type). We prove that it has a unique minimal subshift, and describe it by means of a substitution. This…

Dynamical Systems · Mathematics 2012-03-08 Franz Gähler , Antoine Julien , Jean Savinien

Image tile-based approaches are popular in many image processing applications such as denoising (e.g., non-local means). A key step in their use is grouping the images into clusters, which usually proceeds iteratively splitting the images…

Image and Video Processing · Electrical Eng. & Systems 2025-12-09 Tharindu Wickremasinghe , Marco F. Duarte

We observe that there exists an associative finite dimensional $\mathbb{C}$-algebra $A$ of finite global dimension, such that the bounded derived category $D^b(A)$ of finite dimensional $A$-modules admits an admissible subcategory…

Representation Theory · Mathematics 2023-04-18 Martin Kalck

We study decision problems on geometric tilings. First, we study a variant of the Domino problem where square tiles are replaced by geometric tiles of arbitrary shape. We show that this variant is undecidable regardless of the shapes,…

Discrete Mathematics · Computer Science 2025-11-13 Benjamin Hellouin de Menibus , Victor Lutfalla , Pascal Vanier

We prove that a set of finite perimeter is indecomposable if and only if it is, up to a choice of suitable representative, connected in the 1-fine topology. This gives a topological characterization of indecomposability which is new even in…

Metric Geometry · Mathematics 2025-12-23 Paolo Bonicatto , Panu Lahti , Enrico Pasqualetto