English
Related papers

Related papers: Separating dots with circles

200 papers

The emergence of phase separation is investigated in the framework of a 2D t-J model by means of a variational product ansatz, which covers the infinite lattice by two types of L x L clusters. Clusters of the first type are completely…

Strongly Correlated Electrons · Physics 2009-11-11 A. Fledderjohann , A. Langari , K. -H. Muetter

We classify the topological types of surfaces in the 3-dimensional unit sphere that contain both a great and a small circle through each point. In particular, these surfaces are homeomorphic to one of five normal forms and are either the…

Algebraic Geometry · Mathematics 2025-11-20 Niels Lubbes

We generalise the well-known ``embroidery'' envelopes of chords joining points at angles $t$ and $mt$ of a single circle in several ways. Firstly we allow $m$ to be rational (possibly negative) instead of integral, finding formulas for the…

Differential Geometry · Mathematics 2025-06-23 Peter Giblin , Alexander Wettig

We give some sufficient conditions of separation of two sets of integer points by a hyperplane. Our conditions are related to the notion of convexity of sets of integer points and are weaker than existing notions.

Combinatorics · Mathematics 2014-02-11 Takuya Kashimura , Yasuhide Numata , Akimichi Takemura

The determination of cluster centers generally depends on the scale that we use to analyze the data to be clustered. Inappropriate scale usually leads to unreasonable cluster centers and thus unreasonable results. In this study, we first…

Machine Learning · Statistics 2016-10-20 Xiurui Geng , Hairong Tang

We extend the construction of canonical bases for cluster algebras from unpunctured surfaces to the case where the number of marked points is one, and we show that the cluster algebra is equal to the upper cluster algebra in this case.

Representation Theory · Mathematics 2014-07-29 Ilke Canakci , Kyungyong Lee , Ralf Schiffler

The separation of two sets (or more specific of two cones) plays an important role in different fields of mathematics such as variational analysis, convex analysis, convex geometry, optimization. In the paper, we derive some new results for…

Functional Analysis · Mathematics 2023-08-04 Christian Günther , Bahareh Khazayel , Christiane Tammer

We prove some preliminary results concerning two questions of O.Karpenkov: (1) What is the number of decompositions of torus of dimension 2 into given number f of regions by unions of n geodesics? (2) On the plane there are n circles not in…

Combinatorics · Mathematics 2015-01-06 I. Shnurnikov

The order-$k$ Voronoi tessellation of a locally finite set $X \subseteq \mathbb{R}^n$ decomposes $\mathbb{R}^n$ into convex domains whose points have the same $k$ nearest neighbors in $X$. Assuming $X$ is a stationary Poisson point process,…

Probability · Mathematics 2019-04-26 Herbert Edelsbrunner , Anton Nikitenko

This paper discusses the relationships between gauge theories defined by gauge groups with finite trivially-acting centers, and theories with restrictions on nonperturbative sectors, in two and four dimensions. In two dimensions, these…

High Energy Physics - Theory · Physics 2014-07-30 E. Sharpe

The problem of interpolation at $(n+1)^2$ points on the unit sphere $\mathbb{S}^2$ by spherical polynomials of degree at most $n$ is proved to have a unique solution for several sets of points. The points are located on a number of circles…

Numerical Analysis · Mathematics 2007-05-23 Wolfgang zu Castell , Noemi Lain Fernandez , Yuan Xu

It is proved that for any finite dimensional representation of a prime order group over the field of rational numbers, polynomial invariants of degree at most $3$ separate the orbits. A result providing an upper degree bound for separating…

Commutative Algebra · Mathematics 2025-07-01 Mátyás Domokos

In this paper we study some Erdos type problems in discrete geometry. Our main result is that we show that there is a planar point set of n points such that no four are collinear but no matter how we choose a subset of size $n^{5/6+o(1)} $…

Combinatorics · Mathematics 2018-10-15 Jozsef Balogh , Jozsef Solymosi

One way to characterize configurations of points up to congruence is by considering the distribution of all mutual distances between points. This paper deals with the question if point configurations are uniquely determined by this…

Commutative Algebra · Mathematics 2007-05-23 Mireille Boutin , Gregor Kemper

We consider several ways of decomposing models into parts of bounded size forming a congruence over a base, and show that admitting any such decomposition is equivalent to mutual algebraicity at the level of theories. We also show that a…

Logic · Mathematics 2022-08-11 Samuel Braunfeld , Michael C Laskowski

If all but two vertices of a triangulated sphere have degrees divisible by $k$, then the exceptional vertices are not adjacent. This theorem is proved for $k=2$ with the help of the coloring monodromy. For $k = 3, 4, 5$ colorings by the…

Combinatorics · Mathematics 2015-11-23 Ivan Izmestiev

Generalising Solomon's theorem, C. Gordon and F. Rodriguez-Villegas have proven recently that, in any group, the number of solutions to a system of coefficient-free equations is divisible by the order of this group whenever the rank of the…

Group Theory · Mathematics 2017-05-02 Anton A. Klyachko , Anna A. Mkrtchyan

Gaussian mixture model is very useful in many practical problems. Nevertheless, it cannot be directly generalized to non Euclidean spaces. To overcome this problem we present a spherical Gaussian-based clustering approach for partitioning…

Machine Learning · Computer Science 2017-05-08 Marek Śmieja , Jacek Tabor

Many physical systems can be studied as collections of particles embedded in space, evolving through deterministic evolution equations. Natural questions arise concerning how to characterize these arrangements - are they ordered or…

Computational Physics · Physics 2022-06-03 Emanuel A. Lazar , Jiayin Lu , Chris H. Rycroft

The independence clustering problem is considered in the following formulation: given a set $S$ of random variables, it is required to find the finest partitioning $\{U_1,\dots,U_k\}$ of $S$ into clusters such that the clusters…

Machine Learning · Computer Science 2017-03-21 Daniil Ryabko