English
Related papers

Related papers: Measurable patterns, necklaces, and sets indiscern…

200 papers

We characterize separable multidimensional permutations in terms of forbidden patterns and enumerate them by means of generating function, recursive formula and explicit formula. We find a connection between multidimensional permutations…

Combinatorics · Mathematics 2008-03-25 Andrei Asinowski , Toufik Mansour

Phenomena with a constrained sample space appear frequently in practice. This is the case e.g. with strictly positive data and with compositional data, like percentages and the like. If the natural measure of difference is not the absolute…

Methodology · Statistics 2008-02-20 G. Mateu-Figueras , V. Pawlowsky-Glahn , J. J. Egozcue

Although the CSP (constraint satisfaction problem) is NP-complete, even in the case when all constraints are binary, certain classes of instances are tractable. We study classes of instances defined by excluding subproblems. This approach…

Artificial Intelligence · Computer Science 2012-01-19 Martin C. Cooper , Guillaume Escamocher

We propose a statistical framework to identify topological differences in two populations of random geometric objects. The proposed framework involves first associating a topological signature with random geometric objects and then…

Methodology · Statistics 2026-03-17 Satish Kumar , Subhra Sankar Dhar

We use the measurable Hall's theorem due to Cie\'sla and Sabok to prove that (i) if two measurable sets $A,B \subset \mathbb{R}^d$ of the same measure are bounded remainder sets with respect to a given irrational $d$-dimensional vector…

Metric Geometry · Mathematics 2026-02-13 Mark Mordechai Etkind , Sigrid Grepstad , Mihail N. Kolountzakis , Nir Lev

We study characteristics which might distinguish two-graphs by introducing different numerical measures on the collection of graphs on $n$ vertices. Two conjectures are stated, one using these numerical measures and the other using the deck…

Combinatorics · Mathematics 2008-10-20 David M. Duncan , Thomas R. Hoffman , James P. Solazzo

There are many hard conjectures in graph theory, like Tutte's 5-flow conjecture, and the 5-cycle double cover conjecture, which would be true in general if they would be true for cubic graphs. Since most of them are trivially true for…

Combinatorics · Mathematics 2017-02-24 M. A. Fiol , G. Mazzuoccolo , E. Steffen

We review a number a recent advances in the study of two-dimensional statistical models with strong geometrical constraints. These include folding problems of regular and random lattices as well as the famous meander problem of enumerating…

Statistical Mechanics · Physics 2007-05-23 P. Di Francesco , E. Guitter

A colored graph is a directed graph in which nodes or edges have been assigned colors that are not necessarily unique. Observability problems in such graphs consider whether an agent observing the colors of edges or nodes traversed on a…

Machine Learning · Computer Science 2019-12-18 Mark Chilenski , George Cybenko , Isaac Dekine , Piyush Kumar , Gil Raz

Topology is an important determinant of the behavior of a great number of condensed-matter systems, but until recently has played a minor role in elasticity. We develop a theory for the deformations of a class of twisted non-Euclidean…

Soft Condensed Matter · Physics 2025-08-26 Carlos E. Moguel-Lehmer , Christian D. Santangelo

Continual learning systems operating in fixed-dimensional spaces face a fundamental geometric barrier: the flat manifold problem. When experience is represented as a linear trajectory in Euclidean space, the geodesic distance between…

Machine Learning · Computer Science 2025-12-23 Xin Li

A 2-coloring of the n-cube in the n-dimensional Euclidean space can be considered as an assignment of weights of 1 or 0 to the vertices. Such a colored n-cube is said to be balanced if its center of mass coincides with its geometric center.…

Combinatorics · Mathematics 2009-10-07 William Y. C. Chen , Larry X. W. Wang

We use and adapt the Borsuk-Ulam Theorem from topology to derive limitations on list-replicable and globally stable learning algorithms. We further demonstrate the applicability of our methods in combinatorics and topology. We show that,…

Machine Learning · Computer Science 2023-11-06 Zachary Chase , Bogdan Chornomaz , Shay Moran , Amir Yehudayoff

Persistent cycles, especially the minimal ones, are useful geometric features functioning as augmentations for the intervals in a purely topological persistence diagram (also termed as barcode). In our earlier work, we showed that computing…

Computational Geometry · Computer Science 2020-02-18 Tamal K. Dey , Tao Hou , Sayan Mandal

A measure is 1-rectifiable if there is a countable union of finite length curves whose complement has zero measure. We characterize 1-rectifiable Radon measures $\mu$ in $n$-dimensional Euclidean space for all $n\geq 2$ in terms of…

Metric Geometry · Mathematics 2020-07-21 Matthew Badger , Raanan Schul

A model named `Colored Percolation' has been introduced with its infinite number of versions in two dimensions. The sites of a regular lattice are randomly occupied with probability $p$ and are then colored by one of the $n$ distinct colors…

Statistical Mechanics · Physics 2017-09-13 Sumanta Kundu , S. S. Manna

In two dimensions, $U(N_c)$ gauge theories exhibit a non-trivial topological structure, while $SU(N_c)$ theories are topologically trivial. Hence, for $G = U(N_c)$ the phase space is divided into topological sectors, characterized by a…

High Energy Physics - Lattice · Physics 2024-11-19 Stephan Durr , Philip Rouenhoff

We classify possible supersymmetry-preserving relevant, marginal, and irrelevant deformations of unitary superconformal theories in $d \geq 3$ dimensions. Our method only relies on symmetries and unitarity. Hence, the results are model…

High Energy Physics - Theory · Physics 2016-12-21 Clay Cordova , Thomas T. Dumitrescu , Kenneth Intriligator

We study those measures whose doubling constant is the least possible among doubling measures on a given metric space. It is shown that such measures exist on every metric space supporting at least one doubling measure. In addition, a…

Classical Analysis and ODEs · Mathematics 2025-09-16 Fernando Benito F. de la Cigoña , José M. Conde Alonso , Pedro Tradacete

Rudolph showed that the orbits of any measurable, measure preserving $\mathbb R^d$ action can be measurably tiled by $2^d$ rectangles and asked if this number of tiles is optimal for $d>1$. In this paper, using a tiling of $\mathbb R^d$ by…

Dynamical Systems · Mathematics 2014-05-12 Bryna Kra , Anthony Quas , Ayse Sahin