中文
相关论文

相关论文: Cookie cutters: Bisections with fixed shapes

200 篇论文

In this work, we present scalable balancing domain decomposition by constraints methods for linear systems arising from arbitrary order edge finite element discretizations of multi-material and heterogeneous 3D problems. In order to enforce…

计算工程、金融与科学 · 计算机科学 2024-12-20 Santiago Badia , Alberto F. Martín , Marc Olm

We consider $(k,j)$-colored partitions, partitions in which $k$ colors exist but at most $j$ colors may be chosen per size of part. In particular these generalize overpartitions. Advancing previous work, we find new congruences, including…

组合数学 · 数学 2020-01-24 William J. Keith

A geometric study of twin and grain boundaries in crystals and quasicrystals is achieved via coincidence site lattices (CSLs) and coincidence site modules (CSMs), respectively. Recently, coincidences of shifted lattices and multilattices…

We study existence and non-existence of constant scalar curvature metrics conformal and arbitrarily close to homogeneous metrics on spheres, using variational techniques. This describes all critical points of the Hilbert-Einstein functional…

微分几何 · 数学 2013-08-07 Renato G. Bettiol , Paolo Piccione

We solve the modified Kazdan-Warner problem of finding metrics with prescribed scalar curvature and unit total volume.

微分几何 · 数学 2014-04-29 Shinichiroh Matsuo

Spectral graph bisections are a popular heuristic aimed at approximating the solution of the NP-complete graph bisection problem. This technique, however, does not always provide a robust tool for graph partitioning. Using a special class…

数值分析 · 数学 2015-12-22 John C. Urschel , Ludmil T. Zikatanov

This work introduces a multidimensional generalization of the maximum bisection problem. A mixed integer linear programming formulation is proposed with the proof of its correctness. The numerical tests, made on the randomly generated…

离散数学 · 计算机科学 2015-06-26 Zoran Maksimovic

We consider 4d $\mathcal{N}=1$ gauge theories with R-symmetry on a hemisphere times a torus. We apply localization techniques to evaluate the exact partition function through a cohomological reformulation of the supersymmetry…

高能物理 - 理论 · 物理学 2020-06-15 Pietro Longhi , Fabrizio Nieri , Antonio Pittelli

We investigate a measure of quantum coherence and its extension to quantify quantum macroscopicity. The coherence measure can also quantify the asymmetry of a quantum state with respect to a given group transformation. We then show that a…

量子物理 · 物理学 2018-02-14 Hyukjoon Kwon , Chae-Yeun Park , Kok Chuan Tan , Daekun Ahn , Hyunseok Jeong

Star-shaped bodies are an important nonconvex generalization of convex bodies (e.g., linear programming with violations). Here we present an efficient algorithm for sampling a given star-shaped body. The complexity of the algorithm grows…

数据结构与算法 · 计算机科学 2009-04-06 Karthekeyan Chandrasekaran , Daniel Dadush , Santosh Vempala

We use a well known problem in discrete and computational geometry (partitions of measures by $k$-fans) as a motivation and as a point of departure to illustrate many aspects, both theoretical and computational, of the problem of…

代数拓扑 · 数学 2007-05-23 Pavle V. M. Blagojevic , Sinisa T. Vrecica , Rade T. Zivaljevic

An emergent theory of quantum measurement arises directly by considering the particular subset of many body wavefunctions that can be associated with classical condensed matter and its interaction with delocalized wavefunctions. This…

量子物理 · 物理学 2015-03-03 Clifford Chafin

This paper explores hierarchical clustering in the case where pairs of points have dissimilarity scores (e.g. distances) as a part of the input. The recently introduced objective for points with dissimilarity scores results in every tree…

机器学习 · 计算机科学 2020-09-01 Benjamin Moseley , Yuyan Wang

We study the problem of covering R^d by overlapping translates of a convex body P, such that almost every point of R^d is covered exactly k times. Such a covering of Euclidean space by translations is called a k-tiling. The investigation of…

组合数学 · 数学 2011-03-17 Nick Gravin , Sinai Robins , Dmitry Shiryaev

We study the problems of covering or partitioning a polygon $P$ (possibly with holes) using a minimum number of small pieces, where a small piece is a connected sub-polygon contained in an axis-aligned unit square. For covering, we seek to…

The weighted MAX k-CUT problem involves partitioning a weighted undirected graph into k subsets, or colors, to maximize the sum of the weights of edges between vertices in different subsets. This problem has significant applications across…

量子物理 · 物理学 2025-12-05 Franz G. Fuchs , Ruben P. Bassa , Frida Lien

We discuss the uniqueness of quantum states compatible with given results for measuring a set of observables. For a given pure state, we consider two different types of uniqueness: (1) no other pure state is compatible with the same…

Partitions with distinct even parts have long been the subject of extensive research. In this paper, We present some new perspectives on such partitions from a combinatorial viewpoint, and connect them with signed partitions and bicolored…

组合数学 · 数学 2026-03-12 Haijun Li

We study the question of testing structured properties (classes) of discrete distributions. Specifically, given sample access to an arbitrary distribution $D$ over $[n]$ and a property $\mathcal{P}$, the goal is to distinguish between…

数据结构与算法 · 计算机科学 2016-01-22 Clément L. Canonne , Ilias Diakonikolas , Themis Gouleakis , Ronitt Rubinfeld

A kind of fixed-point problem in the area of discrete tomography is proposed and investigated. Our chief concern in this paper is the case of square windows in the plane. Dealing with the arrays which are bounded, of polynomial growth, and…

组合数学 · 数学 2014-04-07 Fumio Hazama