English
Related papers

Related papers: A survey on Newhouse thickness, fractal intersecti…

200 papers

In this work a new strategy is proposed in order to build analytic and microscopic models of fluctuating polymer rings subjected to topological constraints. The topological invariants used to fix these constraints belong to a wide class of…

Statistical Mechanics · Physics 2020-01-08 Franco Ferrari

In this paper will be introduced large, probably complete family of complex base systems, which are 'proper' - for each point of the space there is a representation which is unique for all but some zero measure set. The condition defining…

Dynamical Systems · Mathematics 2008-02-24 Jarek Duda

We study the interplay between the notions of $n$-coherent rings and finitely $n$-presented modules, and also study the relative homological algebra associated to them. We show that the $n$-coherency of a ring is equivalent to the thickness…

Rings and Algebras · Mathematics 2017-09-05 Daniel Bravo , Marco A. Pérez

This closer study of the FSM: [I] retains the earlier results in offering explanation for the existence of three fermion generations, as well as the hierarchical mass and mixing patterns of leptons and quarks; [II] predicts a vector boson…

High Energy Physics - Phenomenology · Physics 2018-12-26 Jose Bordes , H. M. Chan , S. T. Tsou

This paper defines, for each graph $G$, a flag vector $fG$. The flag vectors of the graphs on $n$ vertices span a space whose dimension is $p(n)$, the number of partitions on $n$. The analogy with convex polytopes indicates that the linear…

Combinatorics · Mathematics 2007-05-23 Jonathan Fine

For a set $S$ of vertices of a graph $G$, we define its density $0 \leq \sigma(S) \leq 1$ as the ratio of the number of edges of $G$ spanned by the vertices of $S$ to ${|S| \choose 2}$. We show that, given a graph $G$ with $n$ vertices and…

Combinatorics · Mathematics 2018-07-06 Alexander Barvinok , Anthony Della Pella

If our aesthetic preferences are affected by fractal geometry of nature, scaling regularities would be expected to appear in all art forms, including music. While a variety of statistical tools have been proposed to analyze time series in…

Pattern Formation and Solitons · Physics 2023-04-05 John McDonough , Andrzej Herczyński

We define a class of lattice models for two-dimensional topological phases with boundary such that both the bulk and the boundary excitations are gapped. The bulk part is constructed using a unitary tensor category $\calC$ as in the…

Strongly Correlated Electrons · Physics 2012-10-01 Alexei Kitaev , Liang Kong

Symmetry breaking for graphs and other combinatorial objects is notoriously hard. On the one hand, complete symmetry breaks are exponential in size. On the other hand, current, state-of-the-art, partial symmetry breaks are often considered…

Logic in Computer Science · Computer Science 2026-04-01 Michael Codish , Mikoláš Janota

Building upon [1], this study aims to introduce fractal geometry into graph theory, and to establish a potential theoretical foundation for complex networks. Specifically, we employ the method of substitution to create and explore…

Dynamical Systems · Mathematics 2024-05-29 Nero Ziyu Li

We consider capacity (fuzzy measure, non-additive probability) on a compactum as a monotone cooperative normed game. We introduce topological analogues of well known class of exact games and show that these classes form subfunctors of the…

General Topology · Mathematics 2026-05-04 Taras Radul

We introduce a generalization of conventional lattice gauge theory to describe fracton topological phases, which are characterized by immobile, point-like topological excitations, and sub-extensive topological degeneracy. We demonstrate a…

Strongly Correlated Electrons · Physics 2017-01-04 Sagar Vijay , Jeongwan Haah , Liang Fu

In this paper, we study the possibility of designing non-trivial random CSP models by exploiting the intrinsic connection between structures and typical-case hardness. We show that constraint consistency, a notion that has been developed to…

Artificial Intelligence · Computer Science 2011-10-12 J. Culberson , Y. Gao

One way to study the combinatorics of finite metric spaces is to study the betweenness relation associated with the metric space. In the hypergraph metrization problem, one has to find and characterize metric betweennesses whose collinear…

Combinatorics · Mathematics 2018-06-07 Péter G. N. Szabó

In categorical compositional semantics of natural language one studies functors from a category of grammatical derivations (such as a Lambek pregroup) to a semantic category (such as real vector spaces). We compositionally build…

Logic in Computer Science · Computer Science 2018-11-09 Jules Hedges , Martha Lewis

We study a combinatorial notion where given a set of lattice points one takes the set of all sums of subsets of a fixed size, and we ask if the given set comes from a convex lattice polytope whether the resulting set also comes from a…

Combinatorics · Mathematics 2021-08-03 Alexander Lemmens

We establish a connection between gaps problems in Diophantine approximation and the frequency spectrum of patches in cut and project sets with special windows. Our theorems provide bounds for the number of distinct frequencies of patches…

Dynamical Systems · Mathematics 2016-06-01 Alan Haynes , Henna Koivusalo , Lorenzo Sadun , James Walton

We examine the dimensions of the intersection of a subset $E$ of an $m$-ary Cantor space $\mathcal{C}^m$ with the image of a subset $F$ under a random isometry with respect to a natural metric. We obtain almost sure upper bounds for the…

Metric Geometry · Mathematics 2015-01-20 Casey Donoven , Kenneth Falconer

Fermion masses and mixing, both in the quark and leptonic sector, are discussed within the approach to the Yukawa puzzle proposed by Arkani-Hamed and Schmaltz. In the quark sector we have shown that at least two extra dimensions are…

High Energy Physics - Phenomenology · Physics 2007-05-23 M. N. Rebelo

Let $k$, $t$ and $m$ be positive integers. A $k$-multiset of $[m]$ is a collection of $k$ integers from the set $\{1,...,m\}$ in which the integers can appear more than once. We use graph homomorphisms and existing theorems for intersecting…

Combinatorics · Mathematics 2015-05-28 Karen Meagher , Alison Purdy