English
Related papers

Related papers: On combinatorial problem concerning partitions of …

200 papers

Given a matrix with partitions of its rows and columns and entries from a field, we give the necessary and sufficient conditions that it has a non--singular submatrix with certain number of rows from each row partition and certain number of…

Combinatorics · Mathematics 2009-08-04 S. M. Sadegh Tabatabaei Yazdi , Serap A. Savari

We present combinatorial and analytical results concerning a Sheffer sequence with a generating function of the form $G(x,z)=Q(z)^{x}Q(-z)^{1-x}$, where $Q$ is a quadratic polynomial with real zeros. By using the properties of Riordan…

Combinatorics · Mathematics 2021-03-03 Gi-Sang Cheon , Tamás Forgács , Hana Kim , Khang Tran

A Banach space $X$ has \textit{property $(K)$}, whenever every weak* null sequence in the dual space admits a convex block subsequence $(f_{n})_{n=1}^\infty$ so that $\langle f_{n},x_{n}\rangle\to 0$ as $n\to \infty$ for every weakly null…

Functional Analysis · Mathematics 2021-02-02 Dongyang Chen , Tomasz Kania , Yingbin Ruan

This work is about a partition problem which is an instance of the distance magic graph labeling problem. Given positive integers $n,k$ and $p_1\le p_2\le \cdots\le p_k$ such that $p_1+\cdots+p_k=n$ and $k$ divides $\sum_{i=1}^ni$, we study…

Combinatorics · Mathematics 2024-01-03 Ehab Ebrahem , Shlomo Hoory , Dani Kotlar

Extensions of a set partition obtained by imposing bounds on the size of the parts and the coloring of some of the elements are examined. Combinatorial properties and the generating functions of some counting sequences associated with these…

Combinatorics · Mathematics 2021-03-09 István Mezo , Victor H. Moll , José L. Ramírez , Diego Villamizar

In this paper, we show that the difference between the number of parts in the odd partitions of $n$ and the number of parts in the distinct partitions of $n$ satisfies Euler's recurrence relation for the partition function $p(n)$ when $n$…

Combinatorics · Mathematics 2020-05-08 Mircea Merca

Let $X$ be a (real or complex) infinite dimensional linear space. We establish conditions on a homogeneous polynomial $P$ on $X$ so that, if $W$ is any finite dimensional subspace of $X$ on which $P$ vanishes, then $P$ vanishes on an…

Functional Analysis · Mathematics 2024-07-18 Mikaela Aires , Geraldo Botelho

This paper reviews some results regarding symbolic dynamics, correspondence between languages of dynamical systems and combinatorics. Sturmian sequences provide a pattern for investigation of one-dimensional systems, in particular interval…

Dynamical Systems · Mathematics 2017-12-01 A. Ya. Belov , G. V. Kondakov , I. Mitrofanov

A bijective proof is given for the following theorem: the number of compositions of n into odd parts equals the number of compositions of n + 1 into parts greater than one. Some commentary about the history of partitions and compositions is…

Combinatorics · Mathematics 2013-12-04 Andrew V. Sills

The number of partitions of n into parts divisible by a or b equals the number of partitions of n in which each part and each difference of two parts is expressible as a non-negative integer combination of a or b. This generalizes…

Combinatorics · Mathematics 2007-06-18 Alexander E. Holroyd

Let $V$ be a quasi-conformal grading-restricted vertex algebra, $W$ be its module, and $\W_{z_1, \ldots, z_n}$ be the space of rational differential forms with complex parameters $(z_1, \ldots, z_n)$ for $n \ge 0$. Using geometric…

Functional Analysis · Mathematics 2024-09-17 A. Zuevsky

Set partitions and permutations with restrictions on the size of the blocks and cycles are important combinatorial sequences. Counting these objects lead to the sequences generalizing the classical Stirling and Bell numbers. The main focus…

Combinatorics · Mathematics 2017-08-01 Victor H. Moll , José L. Ramirez , Diego Villamizar

In the Bin Packing problem one is given $n$ items with weights $w_1,\ldots,w_n$ and $m$ bins with capacities $c_1,\ldots,c_m$. The goal is to find a partition of the items into sets $S_1,\ldots,S_m$ such that $w(S_j) \leq c_j$ for every bin…

Data Structures and Algorithms · Computer Science 2023-09-11 Jesper Nederlof , Jakub Pawlewicz , Céline M. F. Swennenhuis , Karol Węgrzycki

In this note we study the natural question of when the generalised F{\o}lner sets exhibiting property A can be chosen to be subsets of the space itself. We show that for many property A spaces $X$, this is indeed possible. Specifically this…

Metric Geometry · Mathematics 2025-09-24 Graham Niblo , Nick Wright , Jiawen Zhang

Here we show some results related with Kakeya conjecture which says that for any integer $n\geq 2$, a set containing line segments in every dimension in $\mathbb{R}^n$ has full Hausdorff dimension as well as box dimension. We proved here…

Classical Analysis and ODEs · Mathematics 2017-04-17 Han Yu

We consider the covering of a ball in certain normed spaces by its congruent subsets and show that if the finite number of sets is not greater than the dimensionality of the space, then the centre of the ball either belongs to the interior…

Functional Analysis · Mathematics 2017-08-07 Sergij V. Goncharov

We prove the following result: For each closed $n$-dimensional manifold $M$ in a (finite or infinite-dimensional) Banach space $B$, and each positive real $m\leq n$ there exists a pseudomanifold $W^{n+1}\subset B$ such that $\partial…

Metric Geometry · Mathematics 2025-04-18 Sergey Avvakumov , Alexander Nabutovsky

Let $p_{o}(n)$ (resp. $p_{e}(n)$) denote the number of partitions of $n$ with more odd parts (resp. even parts) than even parts (resp. odd parts). Recently, Kim, Kim, and Lovejoy proved that $p_{o}(n)>p_{e}(n)$ for all $n>2$ and conjectured…

Given two finitely generated groups that coarsely embed into a Hilbert space, it is known that their wreath product also embeds coarsely into a Hilbert space. We introduce a wreath product construction for general metric spaces X,Y,Z and…

Group Theory · Mathematics 2013-07-12 Chris Cave , Dennis Dreesen , Ana Khukhro

We announce two breakthrough results concerning important questions in the Theory of Computational Complexity. In this expository paper, a systematic and comprehensive geometric characterization of the Subset Sum Problem is presented. We…

Computational Complexity · Computer Science 2025-11-21 Srinivas Balaji Bollepalli
‹ Prev 1 3 4 5 6 7 10 Next ›