相关论文: Centrally Image partition Regularity near 0

This is Part 2 in a series of papers about the growth of regular partitions in hereditary properties $3$-uniform hypergraphs. The focus of this paper is the notion of weak hypergraph regularity, first developed by Chung, Chung-Graham, and…

This paper presents a novel meta algorithm, Partition-Merge (PM), which takes existing centralized algorithms for graph computation and makes them distributed and faster. In a nutshell, PM divides the graph into small subgraphs using our…

In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…

A finite or infinite matrix A with rational entries is called partition regular if whenever the natural numbers are finitely coloured there is a monochromatic vector x with Ax=0. Many of the classical theorems of Ramsey Theory may naturally…

When regularity lemmas were first developed in the 1970s, they were described as results that promise a partition of any graph into a ``small'' number of parts, such that the graph looks ``similar'' to a random graph on its edge subsets…

Let $A$ be a finite matrix with rational entries. We say that $A$ is {\it doubly image partition regular\/} if whenever the set ${\mathbb N}$ of positive integers is finitely coloured, there exists $\vec x$ such that the entries of $A\vec…

The Central sets theorem was first introduced by H. Furstenberg [F] in terms of Dynamical systems. Later Hindman and Bergelson extended the theorem using Stone-$\v{C}$ech compactification $\beta$$\mathbb{N}$ of $\mathbb{N}$. In [SY]…

In [B] Beiglb\"ock gave a Multidimension Central sets theorem. Recently, [GP] extended this result for polynomials. They proved the Multidimensional Polynomial Central sets theorem. Earlier, Hindman and Leader introduced the near zero…

In this paper, we investigate several types of low complexity of finite partitions, including precompactness, zero maximal pattern entropy, bounded mean complexity and mean equicontinuity. We first show that a collection of finite…

In the present paper we initiate the study of a certain kind of partition inequality, by showing, for example, that if $M\geq 5$ is an integer and the integers $a$ and $b$ are relatively prime to $M$ and satisfy $1\leq a<b<M/2$, and the…

The concept of centrally symmetric configurations of integer matrices is introduced. We study the problem when the toric ring of a centrally symmetric configuration is normal as well as is Gorenstein. In addition, Gr\"obner bases of toric…

An integer partition of $n$ is a decreasing sequence of positive integers that add up to $[n]$. Back in $1979$ Macdonald posed a question about the limit value of the probability that two partitions chosen uniformly at random, and…

Matrix partition problems generalize a number of natural graph partition problems, and have been studied for several standard graph classes. We prove that each matrix partition problem has only finitely many minimal obstructions for split…

In this paper, a new variant of an algorithm for normalized cross-correlation (NCC) is proposed in the context of template matching in images. The proposed algorithm is based on the precomputation of a template image approximation, enabling…

We investigate various forms of (model-theoretic) stability for hypergraphs and their corresponding strengthenings of the hypergraph regularity lemma with respect to partitions of vertices. On the one hand, we provide a complete…

In recent years increasing attention has been paid on the area of supercharacter theories, especially to those of the upper unitriangular group. A particular supercharacter theory, in which supercharacters are indexed by set partitions, has…

We study algorithms for approximating the permanent of a random matrix when the entries are slightly biased away from zero. This question is motivated by the goal of understanding the classical complexity of linear optics and \emph{boson…

The scarcity of pixel-level annotation is a prevalent problem in medical image segmentation tasks. In this paper, we introduce a novel regularization strategy involving interpolation-based mixing for semi-supervised medical image…

Image segmentation is a central topic in image processing and computer vision and a key issue in many applications, e.g., in medical imaging, microscopy, document analysis and remote sensing. According to the human perception, image…

We propose a novel unsupervised image segmentation algorithm, which aims to segment an image into several coherent parts. It requires no user input, no supervised learning phase and assumes an unknown number of segments. It achieves this by…