English
Related papers

Related papers: Modules in Robinson Spaces

200 papers

Many signal processing problems can be solved by maximizing the fitness of a segmented model over all possible partitions of the data interval. This letter describes a simple but powerful algorithm that searches the exponentially large…

Rounding has proven to be a fundamental tool in theoretical computer science. By observing that rounding and partitioning of $\mathbb{R}^d$ are equivalent, we introduce the following natural partition problem which we call the {\em secluded…

Discrete Mathematics · Computer Science 2022-11-08 Jason Vander Woude , Peter Dixon , A. Pavan , Jamie Radcliffe , N. V. Vinodchandran

The group of combinatorial self-similarities of a pseudometric space $(X, d)$ is the maximal subgroup of the symmetric group $\mathbf{Sym} (X)$ whose elements preserve the four-point equality $d(x,y)=d(u,v)$. Let us denote by $\mathcal{IP}$…

Metric Geometry · Mathematics 2023-11-27 Viktoriia Bilet , Oleksiy Dovgoshey

Given a rectangle $R$ with area $A$ and a set of areas $L=\{A_1,...,A_n\}$ with $\sum_{i=1}^n A_i = A$, we consider the problem of partitioning $R$ into $n$ sub-regions $R_1,...,R_n$ with areas $A_1,...,A_n$ in a way that the total…

Optimization and Control · Mathematics 2023-09-06 Reyhaneh Mohammadi , Mehdi Behroozi

Understanding how systems built out of modular components can be jointly optimized is an important problem in biology, engineering, and machine learning. The backpropagation algorithm is one such solution and has been instrumental in the…

Machine Learning · Computer Science 2026-03-05 Christian Pehle , Jean-Jacques Slotine

This paper presents a mathematical framework for analyzing machine learning models through the geometry of their induced partitions. By representing partitions as Riemannian simplicial complexes, we capture not only adjacency relationships…

Machine Learning · Computer Science 2025-08-05 Pawel Gajer , Jacques Ravel

A Lambda (Card Lambda > aleph)-product space of {0,1} has a partition {X1,...,Xn} for any n a decomposition space of each Xi of which is self-similar.(February 16, 2015)

General Topology · Mathematics 2015-02-19 Akihiko Kitada , Shousuke Ohmori , Tomoyuki Yamamoto

Let $k, t$ be coprime integers, and let $1 \leq r \leq t$. We let $D_k^\times(r,t;n)$ denote the total number of parts among all $k$-indivisible partitions (i.e., those partitions where no part is divisible by $k$) of $n$ which are…

Combinatorics · Mathematics 2023-05-11 Faye Jackson , Misheel Otgonbayar

We give examples illustrating the fact that the different space/time splittings of the tangent bundle of a semi-Riemannian spin manifold give rise to non-equivalent norms on the space of compactly supported sections of the spinor bundle,…

Differential Geometry · Mathematics 2019-07-24 Fabien Besnard , Nadir Bizi

Various real-world problems consist of partitioning a set of locations into disjoint subsets, each subset spread in a way that it covers the whole set with a certain radius. Given a finite set S, a metric d, and a radius r, define a subset…

Data Structures and Algorithms · Computer Science 2023-02-08 Eran Rosenbluth

For integers $k,t \geq 2$, and $1\leq r \leq t$ let $D_k^\times(r,t;n)$ be the number of parts among all $k$-indivisible partitions of $n$ (i.e., partitions where all parts are not divisible by $k$) of $n$ that are congruent to $r$ modulo…

Combinatorics · Mathematics 2025-09-30 Faye Jackson , Misheel Otgonbayar

The MM principle is a device for creating optimization algorithms satisfying the ascent or descent property. The current survey emphasizes the role of the MM principle in nonlinear programming. For smooth functions, one can construct an…

Optimization and Control · Mathematics 2015-07-29 Kenneth Lange , Kevin L. Keys

Let P be a d-dimensional n-point set. A Tverberg-partition of P is a partition of P into r sets P_1, ..., P_r such that the convex hulls conv(P_1), ..., conv(P_r) have non-empty intersection. A point in the intersection of the conv(P_i)'s…

Computational Geometry · Computer Science 2020-07-02 Wolfgang Mulzer , Daniel Werner

This paper proposes a generalized framework with joint normalization which learns lower-dimensional subspaces with maximum discriminative power by making use of the Riemannian geometry. In particular, we model the similarity/dissimilarity…

Computer Vision and Pattern Recognition · Computer Science 2017-11-20 Tianci Liu , Zelin Shi , Yunpeng Liu

Let $X$ a probability measure space and $\psi_1....\psi_N$ measurable, real valued functions on $X$. Consider all possible partitions of $X$ into $N$ disjoint subdomains $X_i$ on which $\int_{X_i}\psi_i$ are prescribed. We address the…

Optimization and Control · Mathematics 2012-08-07 Gershon Wolansky

For a given smooth manifold, we consider the moduli space of Riemannian metrics up to isometry and scaling. One can define a preorder on the moduli space by the size of isometry groups. We call a Riemannian metric that attains a maximal…

Differential Geometry · Mathematics 2022-10-05 Yuichiro Taketomi

This paper presents a general framework for calculating the dimension of spline spaces over arbitrary rectilinear partitions using the smoothing cofactor method. The approach extends existing dimension theory for polynomial splines over…

Numerical Analysis · Mathematics 2026-05-15 Bingru Huang , Falai Chen

Six-dimensional (2, 0) theory can be defined on a large class of six-manifolds endowed with some additional topological and geometric data (i.e. an orientation, a spin structure, a conformal structure, and an R-symmetry bundle with…

High Energy Physics - Theory · Physics 2015-05-20 Mans Henningson

The Robinson Splitting Theorem states that a c.e. degree $\mathbf{b}$ splits over any low c.e. degree $\mathbf{c}<\mathbf{b}$. We prove that a weaker version of this theorem holds in models of $\mathrm{P}^-+\mathrm{I}\Sigma_1$, with lowness…

Logic · Mathematics 2026-03-05 Yong Liu , Cheng Peng , Mengzhou Sun

A space $X$ is called selectively separable(R-separable) if for every sequence of dense subspaces $(D_n : n\in\omega)$ one can pick finite (respectively, one-point) subsets $F_n\subset D_n$ such that $\bigcup_{n\in\omega}F_n$ is dense in…

General Topology · Mathematics 2011-12-09 Angelo Bella , Mikhail Matveev , Santi Spadaro