English
Related papers

Related papers: On bar lengths in partitions

200 papers

We study some measure partition problems: Cut the same positive fraction of $d+1$ measures in $\mathbb R^d$ with a hyperplane or find a convex subset of $\mathbb R^d$ on which $d+1$ given measures have the same prescribed value. For both…

Metric Geometry · Mathematics 2013-02-13 Arseniy Akopyan , Roman Karasev

We obtain a closed formula for the $v$-decomposition numbers $d_{\lambda\mu}(v)$ arising from the canonical basis of the Fock space representation of $U_v(\hat{\mathfrak{sl}}_e)$, where the partition $\lambda$ is obtained from $\mu$ by…

Representation Theory · Mathematics 2011-05-25 Kai Meng Tan , Wei Hao Teo

In this paper, we study $(s,s+1)$-core partitions with $d$-distinct parts. We obtain results on the number and the largest size of such partitions, so we extend Xiong's paper in which the results are obtained about $(s,s+1)$-core partitions…

Combinatorics · Mathematics 2019-11-26 Murat Sahin

The paper contains an exposition of part of topology using partitions of unity. The main idea is to create variants of the Tietze Extension Theorem and use them to derive classical theorems. This idea leads to a new result generalizing…

General Topology · Mathematics 2008-02-28 Jerzy Dydak

This paper completes the classification of maximal unrefinable partitions, extending a previous work of Aragona et al. devoted only to the case of triangular numbers. We show that the number of maximal unrefinable partitions of an integer…

Combinatorics · Mathematics 2025-12-22 Riccardo Aragona , Lorenzo Campioni , Roberto Civino

We give explicit formulas to compute most of the decomposition numbers of reductions modulo 2 of irreducible spin representations of symmetric groups indexed by partitions with at most 2 parts. In many of the still open cases small upper…

Representation Theory · Mathematics 2024-02-02 Lucia Morotti

In this paper, we further develop the theory of circles of partition by introducing the notion of complex circles of partition. This work generalizes the classical framework, extending from subsets of the natural numbers as base sets to…

General Mathematics · Mathematics 2026-05-05 Berndt Gensel , Theophilus Agama

Let $\gamma_1,\gamma_2$ be a pair of constant-degree irreducible algebraic curves in $\mathbb{R}^d$. Assume that $\gamma_i$ is neither contained in a hyperplane nor in a quadric surface in $\mathbb{R}^d$, for each $i=1,2$. We show that for…

Combinatorics · Mathematics 2023-04-17 Hadas Baer-Erenfeld , Orit E. Raz

Let $s,t$ be natural numbers, and fix an $s$-core partition $\sigma$ and a $t$-core partition $\tau$. Put $d=\gcd(s,t)$ and $m= lcm(s,t)$, and write $N_{\sigma, \tau}(k)$ for the number of $m$-core partitions of length no greater than $k$…

Combinatorics · Mathematics 2022-02-01 K. Seethalakshmi , Steven Spallone

The aim of this paper is to derive explicit formulas for two distinct values. The first is the total number of symmetric peaks in a set partition of $[n]$ with exactly $k$ blocks, and the second one is the total number of non-symmetric…

Combinatorics · Mathematics 2024-08-21 Walaa Asakly , Noor Kezil

The introduction of bars in-between blocks of an ordered set partition(preferential arrangement) results in a barred ordered set partition(barred preferential arrange- ment). Having the restriction that some blocks of barred preferential…

Combinatorics · Mathematics 2015-09-25 S. Nkonkobe , V. Murali

Let $D$ be a digraph and let $\lambda(D)$ denote the number of vertices in a longest path of $D$. For a pair of vertex-disjoint induced subdigraphs $A$ and $B$ of $D$, we say that $(A,B)$ is a partition of $D$ if $V(A)\cup V(B)=V(D).$ The…

Combinatorics · Mathematics 2021-11-19 Jiangdong Ai , Stefanie Gerke , Gregory Gutin , Yacong Zhou

We study the correlators of irregular vertex operators in two-dimensional conformal field theory (CFT) in order to propose an exact analytic formula for calculating numbers of partitions, that is: 1) for given $N,k$, finding the total…

Number Theory · Mathematics 2017-03-03 Dimitri Polyakov

Logic-based Benders decomposition (LBBD) is a substantial generalization of classical Benders decomposition that, in principle, allows the subproblem to be any optimization problem rather than specifically a linear or nonlinear programming…

Optimization and Control · Mathematics 2019-10-29 J. N. Hooker

We study a two-parameter generalization of the Catalan numbers: $C_{d,p}(n)$ is the number of ways to subdivide the $d$-dimensional hypercube into $n$ rectangular blocks using orthogonal partitions of fixed arity $p$. Bremner \& Dotsenko…

Combinatorics · Mathematics 2025-12-04 Yu Hin Au , Fatemeh Bagherzadeh , Murray R. Bremner

We give combinatorial proofs of two identities from the representation theory of the partition algebra $C A_k(n), n \ge 2k$. The first is $n^k = \sum_\lambda f^\lambda m_k^\lambda$, where the sum is over partitions $\lambda$ of $n$,…

Combinatorics · Mathematics 2007-05-23 Tom Halverson , Tim Lewandowski

For $d\geq 1$, we define semibricks and wide subcategories in the $d$-extended hearts of bounded $t$-structures on a triangulated category. We show that these semibricks are in bijection with finite-length wide subcategories. When the…

Representation Theory · Mathematics 2025-11-12 Esha Gupta , Yu Zhou

In the complete hyperbolic structure on the complement of the figure eight knot, we determine the set of lambda lengths from the maximal cusp to itself. Using the correspondence between spinors and spin-decorated horospheres, we show that…

Geometric Topology · Mathematics 2024-11-12 Joshua A. Howie , Dionne Ibarra , Daniel V. Mathews , Lecheng Su

In this paper we present a new formula for the number of unrestricted partitions of $n$. We do this by introducing a correspondence between the number of unrestrited partitions of $n$ and the number of non-negative solutions of systems of…

Combinatorics · Mathematics 2019-06-27 Hemar Godinho , José Plínio O. Santos

The set of permutations on a finite set can be given the lattice structure known as the weak Bruhat order. This lattice structure is generalized to the set of words on a fixed alphabet $\Sigma$ = {x,y,z,...}, where each letter has a fixed…

Combinatorics · Mathematics 2018-12-19 Maria João Gouveia , Luigi Santocanale
‹ Prev 1 4 5 6 7 8 10 Next ›