English
Related papers

Related papers: On certain unimodal sequences and strict partition…

200 papers

We study the representations of a class of non-commutative polynomial algebras truncated at degree 3, with one additional relation. We determine the irreducible components of their varieties of representations. We do this by showing that…

Representation Theory · Mathematics 2024-10-28 Marko Čmrlec

Cameron introduced a bijection between the set of sum-free sets and the set of all zero-one sequences. In this paper, we study the sum-free sets of natural numbers corresponding to certain zero-one sequences which contain the Cantor-like…

Number Theory · Mathematics 2015-05-13 Zhi-Xiong Wen , Wen Wu , Jie-Meng Zhang

We prove a lemma that is useful to get upper bounds for the number of partitions without a given subsum. From this we can deduce an improved upper bound for the number of sets represented by the (unrestricted or into unequal parts)…

Combinatorics · Mathematics 2007-11-07 Jean-Christophe Aval

We define a broad class of crossed product C*-algebras of the form C(G)xG, where G is a discrete countable amenable residually finite group, and G is a profinite completion of G. We show that they are unital separable simple nuclear…

Operator Algebras · Mathematics 2013-01-22 Stefanos Orfanos

We investigate the set of partial partitions of a finite set, ordered by inclusion. With this ordering the set of partial partitions can be studied as an abstract simplicial complex. We use the theory of shellable nonpure complexes to find…

Combinatorics · Mathematics 2023-11-21 Michael J. Gottstein

Motivated by Andrews' recent work related to Euler's partition theorem, we consider the set of partitions of an integer $n$ where the set of even parts has exactly $j$ elements, versus the set of partitions of $n$ where the set of repeated…

Combinatorics · Mathematics 2017-05-16 Shishuo Fu , Dazhao Tang

A graph has a perfect partition if all its perfect matchings can be partitioned so that each part is a 1-factorization of the graph. Let $L_{rm, r}=K_{rm,rm}-mK_{r,r}$. We first give a formula to count the number of perfect matchings of…

Combinatorics · Mathematics 2012-12-27 Chi-Kwong Li , Jeff Soosiah , Gexin Yu

Let $G$ be an additive abelian group. A sequence $S=g_1\cdot\ldots\cdot g_{\ell}$ of terms from $G$ is a plus-minus weighted zero-sum sequence if there are $\varepsilon_1,\ldots,\varepsilon_{\ell}\in\{-1,1\}$ such that $\varepsilon_1…

Commutative Algebra · Mathematics 2023-09-13 Florin Fabsits , Alfred Geroldinger , Andreas Reinhart , Qinghai Zhong

In this work we prove an universality result regarding the equidistribution of zeros of random holomorphic sections associated to a sequence of singular Hermitian holomorphic line bundles on a compact K\"ahler complex space $X$. Namely,…

Complex Variables · Mathematics 2020-04-15 Turgay Bayraktar , Dan Coman , George Marinescu

We provide a splitting criterion for supervector bundles over the projective superspaces $\mathbb{P}^{n|m}$. More precisely, we prove that a rank $p|q$ supervector bundle on $\mathbb{P}^{n|m}$ with vanishing intermediate cohomology is…

Algebraic Geometry · Mathematics 2025-01-22 Charles Almeida , Ugo Bruzzo

B\"ackstr\"om orders are a class of algebras over complete discrete valuation rings. Their Cohen-Macaulay representations are in correspondence with the representations of certain quivers/species by Ringel and Roggenkamp. In this paper, we…

Representation Theory · Mathematics 2025-12-03 Hongrui Wei

We study the enumeration problem of higher dimensional partitions, a natural generalisation of classical integer partitions. We show that their counting problem is equivalent to the enumeration of simpler classes of higher dimensional…

Combinatorics · Mathematics 2025-01-20 Michele Graffeo , Sergej Monavari , Riccardo Moschetti , Andrea T. Ricolfi

We relate the computational complexity of finite strings to universal representations of their underlying symmetries. First, Boolean functions are classified using the universal covering topologies of the circuits which enumerate them. A…

Information Theory · Computer Science 2011-09-20 John Scoville

A graded-division algebra is an algebra graded by a group such that all nonzero homogeneous elements are invertible. This includes division algebras equipped with an arbitrary group grading (including the trivial grading). We show that a…

Rings and Algebras · Mathematics 2019-12-30 Yuri Bahturin , Alberto Elduque , Mikhail Kochetov

We give a characterisation of the idempotents of the partition monoid, and use this to enumerate the idempotents in the finite partition, Brauer and partial Brauer monoids, giving several formulae and recursions for the number of…

We find an asymptotic enumeration formula for the number of simple $r$-uniform hypergraphs with a given degree sequence, when the number of edges is sufficiently large. The formula is given in terms of the solution of a system of equations.…

Combinatorics · Mathematics 2022-05-18 Catherine Greenhill , Mikhail Isaev , Tamás Makai , Brendan D. McKay

For two sets $A$ and $M$ of positive integers and for a positive integer $n$, let $p(n,A,M)$ denote the number of partitions of $n$ with parts in $A$ and multiplicities in $M$, that is, the number of representations of $n$ in the form…

Combinatorics · Mathematics 2012-07-16 Noga Alon

This paper deals with properties of the algebraic variety defined as the set of zeros of a "deficient" sequence of multivariate polynomials. We consider two types of varieties: ideal-theoretic complete intersections and absolutely…

Algebraic Geometry · Mathematics 2022-08-19 Nardo Giménez , Guillermo Matera , Mariana Pérez , Melina Privitelli

Birch and Tverberg partitions are closely related concepts from discrete geometry. We show two properties for the number of Birch partitions: Evenness, and a lower bound. This implies the first non-trivial lower bound for the number of…

Combinatorics · Mathematics 2008-04-17 Stephan Hell

Inspired by the study of the minimal excludant in integer partitions by G.E. Andrews and D. Newman, we introduce a pair of new partition statistics, sqrank and rerank. They are related to a polynomial bosonic form of statistical…

Combinatorics · Mathematics 2026-02-13 Taichiro Takagi
‹ Prev 1 3 4 5 6 7 10 Next ›