English
Related papers

Related papers: On combinatorial problem concerning partitions of …

200 papers

Let $K$ be an algebrically closed field and let $n\geq 1$. If $P\in K[X]=K[X_1,\ldots,X_n]$, $P\neq 0$, we denote by $I(P)$ the support of $P$, which is the finite subset of $\mathbb N^n$ such that $P=\sum_{i\in I(P)}a_iX^i$ with $a_i\in…

Commutative Algebra · Mathematics 2010-08-31 Constantin-Nicolae Beli

In this article, we discuss the notion of partition of elements in an arbitrary Coxeter system $(W,S)$: a partition of an element $w$ is a subset $\mathcal P\subseteq W$ such that the left inversion set of $w$ is the disjoint union of the…

Combinatorics · Mathematics 2026-03-13 Christophe Hohlweg , Viviane Pons

Given an arbitrary spectral space $X$, we endow it with its specialization order $\leq$ and we study the interplay between suprema of subsets of $(X,\leq)$ and the constructible topology. More precisely, we investigate about when the…

General Topology · Mathematics 2019-11-27 Carmelo Antonio Finocchiaro , Dario Spirito

For $x\ge0$ let $\pi(x)$ be the number of primes not exceeding $x$. The asymptotic behaviors of the prime-counting function $\pi(x)$ and the $n$-th prime $p_n$ have been studied intensively in analytic number theory. Surprisingly, we find…

Number Theory · Mathematics 2016-02-26 Zhi-Wei Sun

A classical theorem of Baranyai states that, given integers $2\leq k < n$ such that $k$ divides $n$, one can find a family of ${n-1\choose k-1}$ partitions of $[n]$ into $k$-element subsets such that every subset appears in exactly one…

Combinatorics · Mathematics 2024-10-14 Zoe Xi

This paper is concerned with the distribution in the complex plane of the roots of a polynomial sequence $\{W_n(x)\}_{n\ge0}$ given by a recursion $W_n(x)=aW_{n-1}(x)+(bx+c)W_{n-2}(x)$, with $W_0(x)=1$ and $W_1(x)=t(x-r)$, where $a>0$,…

Combinatorics · Mathematics 2015-01-27 J. L. Gross , T. Mansour , T. W. Tucker , D. G. L. Wang

The partition perimeter is a statistic defined to be one less than the sum of the number of parts and the largest part. Recently, Amdeberhan, Andrews, and Ballantine proved the following analog of Glaisher's theorem: for all $m \geq 2$ and…

Combinatorics · Mathematics 2023-09-06 Hunter Waldron

A wide range of physical problems can be described by randomly-oriented linear trajectories, including any system of objects, organisms, particles, or rays that follow a linear path. Dependent upon the particular random variables that…

Probability · Mathematics 2014-01-03 Gregory T. Clement

We determine the structure of the partition algebra $P_n(Q)$ (a generalized Temperley-Lieb algebra) for specific values of $Q \in \C$, focusing on the quotient which gives rise to the partition function of $n$ site $Q$-state Potts models…

High Energy Physics - Theory · Physics 2009-10-22 Paul Martin , Hubert Saleur

We prove partition regularity of the configuration $x,y,x+y,y/x$ in a strong infinitary form that extends Hindman's Theorem. We study the related issue of partition regularity of configurations involving products of a degree one polynomial…

The Satisfactory Partition problem consists in deciding if the set of vertices of a given undirected graph can be partitioned into two nonempty parts such that each vertex has at least as many neighbours in its part as in the other part.…

Data Structures and Algorithms · Computer Science 2020-07-29 Ajinkya Gaikwad , Soumen Maity , Shuvam Kant Tripathi

For convex partitions of a convex body $B$ we prove that we can put a homothetic copy of $B$ into each set of the partition so that the sum of homothety coefficients is $\ge 1$. In the plane the partition may be arbitrary, while in higher…

Combinatorics · Mathematics 2012-12-27 Arseniy Akopyan , Roman Karasev

The famous van der Waerden theorem states that if partition N into finitely many cells then one of them will contain arbitrary length arithmetic progressions. It has a polynomial version also. In this article we will prove the near 0…

Combinatorics · Mathematics 2020-05-11 Pintu Debnath , Sayan Goswami

Unrefinable partitions are a subset of partitions into distinct parts which satisfy an additional unrefinability property. More precisely, being an unrefinable partition means that none of the parts can be written as the sum of smaller…

Combinatorics · Mathematics 2023-01-11 Riccardo Aragona , Lorenzo Campioni , Roberto Civino , Massimo Lauria

The paper is concerned with the classical occupancy scheme with infinitely many boxes, in which $n$ balls are thrown independently into boxes $1,2,...$, with probability $p_j$ of hitting the box $j$, where $p_1\geq p_2\geq...>0$ and…

Probability · Mathematics 2008-09-26 A. D. Barbour , A. V. Gnedin

We introduce and study Banach spaces which have property CWO, i.e., every finite convex combination of relatively weakly open subsets of their unit ball is open in the relative weak topology of the unit ball. Stability results of such…

Functional Analysis · Mathematics 2018-06-29 Trond Arnold Abrahamsen , Julio Becerra Guerrero , Rainis Haller , Vegard Lima , Märt Põldvere

The problem of finding independent components of an indexed object (e.g., a tensor) with arbitrary number of indices and arbitrary linear symmetries is discussed. It is proved that the number of independent components $f(k)$ is a polynomial…

General Relativity and Quantum Cosmology · Physics 2007-05-23 Sergei A. Klioner

We examine the structure of the partition algebra $P_n(\delta)$ over a field $k$ of characteristic $p>0$. In particular, we describe the decomposition matrix of $P_n(\delta)$ when $n<p$ and when $n=p$ and $\delta=p-1$.

Representation Theory · Mathematics 2014-03-27 Oliver King

In this paper we prove that the nonzero elements of a finite field with odd characteristic can be partitioned into pairs with prescribed difference (maybe, with some alternatives) in each pair. The algebraic and topological approaches to…

Combinatorics · Mathematics 2011-03-14 R. N. Karasev , F. V. Petrov

Let $n > m\ge 2$ be integers and let $\mathcal{A}=\{A_1,\dots,A_m\}$ be a partition of $[n]=\{1,\dots,n\}$. For $X \subseteq [n]$, its $\mathcal{A}$-boundary region $\mathcal{A}(X)$ is defined to be the union of those blocks $A_i$ of…

Combinatorics · Mathematics 2019-06-21 Konrad Engel , Tran Dan Thu
‹ Prev 1 4 5 6 7 8 10 Next ›