Related papers: Decomposition of Integral Self-Affine Multi-Tiles
Integrable couplings are associated with non-semisimple Lie algebras. In this paper, we propose a new method to generate new integrable systems through making perturbation in matrix spectral problems for integrable couplings, which is…
Let $K/k$ be a finite abelian CM-extension and $T$ a suitable finite set of finite primes of $k$. In this paper, we determine the Fitting ideal of the minus component of the $T$-ray class group of $K$, except for the $2$-component, assuming…
Thread-like structures are pervasive across scales, from polymeric proteins to root systems to galaxy filaments, and their characteristics can be readily investigated in the network formalism. Yet, network links usually represent only parts…
One of the key aspects governing the mechanical performance of composite materials is debonding: the local separation of reinforcing constituents from matrix when the interfacial strength is exceeded. In this contribution, two strategies to…
A planar set $P$ is said to be cover-decomposable if there is a constant $k=k(P)$ such that every $k$-fold covering of the plane with translates of $P$ can be decomposed into two coverings. It is known that open convex polygons are…
Let L be a finite Galois extension of K with Galois group G. We decompose any idempotent 2-cocycle f using finite sequences of descending two-sided ideals of the corresponding weak crossed product algebra A:= (L/k, G, f). We specialise the…
Few-sample compression aims to compress a big redundant model into a small compact one with only few samples. If we fine-tune models with these limited few samples directly, models will be vulnerable to overfit and learn almost nothing.…
We study the set of all decompositions (clusterings) of a graph through its characterization as a set of lifted multicuts. This leads us to practically relevant insights related to the definition of a class of decompositions by must-join…
A set is said to tile the integers if and only if the integers can be written as a disjoint union of translates of that set. We consider the problem of finding necessary and sufficient conditions for a finite set to tile the integers. For…
Extending the idea of Even and Lehrer [3], we discuss a general approach to integration based on a given decomposition system equipped with a weighting function, and a decomposition of the integrated function. We distinguish two type of…
This paper deals with the estimation of the modes of an univariate mixture when the number of components is known and when the component density are well separated. We propose an algorithm based on the minimization of the "kp" criterion we…
In this paper, we apply Clausen-Scholze's theory of solid modules to the existence of adelic decompositions for schemes of finite type over $\mathbb{Z}$. Specifically, we use the six-functor formalism for solid modules to define the…
For a maximal separable subfield $K$ of a central simple algebra $A$, we provide a semiring isomorphism between $K$-$K$-bimodules $A$ and $H$-$H$ bisets of $G = \Gal(L/F)$, where $F = \operatorname{Z}(A)$, $L$ is the Galois closure of…
A mechanism to derive non-repetitive coverage path solutions with a proven minimal number of discontinuities is proposed in this work, with the aim to avoid unnecessary, costly end effector lift-offs for manipulators. The problem is…
Let $M$ be a $3\times 3$ integer matrix each of whose eigenvalues is greater than $1$ in modulus and let $\mathcal{D}\subset\mathbb{Z}^3$ be a set with $|\mathcal{D}|=|\det M|$, called digit set. The set equation $MT = T+\mathcal{D}$…
We investigate products J of ideals of "row initial" minors in the polynomial ring K[X] defined by a generic m-by-n matrix. Such ideals are shown to be generated by a certain set of standard bitableaux that we call superstandard. These…
In low-light image enhancement, Retinex-based deep learning methods have garnered significant attention due to their exceptional interpretability. These methods decompose images into mutually independent illumination and reflectance…
We provide a new framework for generating multiple good quality partitions (clusterings) of a single data set. Our approach decomposes this problem into two components, generating many high-quality partitions, and then grouping these…
A finite collection $P$ of finite sets tiles the integers iff the integers can be expressed as a disjoint union of translates of members of $P$. We associate with such a tiling a doubly infinite sequence with entries from $P$. The set of…
Identifying and suppressing streaking artifacts is one of the most challenging problems in quantitative susceptibility mapping. The measured phase from tissue magnetization is assumed to be the convolution by the magnetic dipole kernel;…