English
Related papers

Related papers: Equivariant Euler characteristics of partition pos…

200 papers

Let $\om $ be a bounded domain in an $n$-dimensional Euclidean space $\Bbb R^n$. We study eigenvalues of an eigenvalue problem of a system of elliptic equations: $$ \{\aligned &\Delta {\mathbf u}+ \alpha{\rm grad}(\text{div}{\mathbf…

Differential Geometry · Mathematics 2010-09-09 Daguang Chen , Qing-Ming Cheng , Qiaoling Wang , Changyu Xia

We give short elementary expositions of combinatorial proofs of some variants of Euler's partitition problem that were first addressed analytically by George Andrews, and later combinatorially by others. Our methods, based on ideas from a…

Combinatorics · Mathematics 2021-07-19 Aritro Pathak

In this paper, for a finite group, we discuss a method for calculating equivariant homology with constant coefficients. We apply it to completely calculate the geometric fixed points of the equivariant spectrum representing equivariant…

Algebraic Topology · Mathematics 2020-11-24 Sophie Kriz

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

The variational properties of the scalar so--called ``Universal'' equations are reviewed and generalised. In particular, we note that contrary to earlier claims, each member of the Euler hierarchy may have an explicit field dependence. The…

High Energy Physics - Theory · Physics 2008-11-26 J. A. Mulvey

A partition polynomial is a refinement of the partition number p(n) whose coefficients count some special partition statistic. Just as partition numbers have useful asymptotics so do partition polynomials. In fact, their asymptotics…

Combinatorics · Mathematics 2021-11-25 Robert P. Boyer , Daniel Parry

We consider the number of various partitions of $n$ with parts separated by parity and prove combinatorially several inequalities between these numbers. For example, we show that for $n\geq 5$ we have $p_{od}^{eu}(n)<p_{ed}^{ou}(n)$, where…

Combinatorics · Mathematics 2024-06-04 Cristina Ballantine , Amanda Welch

We derive the canonical ensemble partition functions for gauged permutation invariant tensor quantum harmonic oscillator thermodynamics, finding surprisingly simple expressions with number-theoretic characteristics. These systems have a…

High Energy Physics - Theory · Physics 2025-08-06 Denjoe O'Connor , Sanjaye Ramgoolam

In this paper, we establish more properties of generalized poly-Euler polynomials with three parameters and we investigate a kind of symmetrized generalization of poly- Euler polynomials. Moreover, we introduce a more general form of multi…

Number Theory · Mathematics 2015-08-11 Hassan Jolany , Roberto B. Corcino

Linear neural network layers that are either equivariant or invariant to permutations of their inputs form core building blocks of modern deep learning architectures. Examples include the layers of DeepSets, as well as linear layers…

Machine Learning · Computer Science 2023-03-14 Charles Godfrey , Michael G. Rawson , Davis Brown , Henry Kvinge

Let $G$ be a finite group and $N\unlhd G$ with $|G: N|=p$ for some prime $p$. In this note, to compute $m_{G,N}$ directly, we construct a class poset $\mathfrak{T}_{C}(G)$ of $G$ for some cyclic subgroup $C$. And we find a relation between…

Group Theory · Mathematics 2017-01-30 Heguo Liu , Xingzhong Xu , Jiping Zhang

We present an algorithm which takes as input a closed semi-algebraic set, $S \subset \R^k$, defined by \[ P_1 \leq 0, ..., P_\ell \leq 0, P_i \in \R[X_1,...,X_k], \deg(P_i) \leq 2, \] and computes the Euler-Poincar\'e characteristic of $S$.…

Symbolic Computation · Computer Science 2007-05-23 Saugata Basu

We give explicit computations of the $\Gamma$-Euler characteristic of several families of orbit space definable translation groupoids. These include the translation groupoids associated to finite-dimensional linear representations of the…

Algebraic Topology · Mathematics 2025-08-27 Carla Farsi , Hannah Mobley , Christopher Seaton

A novel invariant decomposition of diagonalizable $n \times n$ matrices into $n$ commuting matrices is presented. This decomposition is subsequently used to split the fundamental representation of $\mathfrak{su}(3)$ Lie algebra elements…

Mathematical Physics · Physics 2025-10-16 Martin Roelfs

An expository summary of properties of the poset of Dyck paths ordered by inclusion.

Combinatorics · Mathematics 2010-11-24 Jennifer Woodcock

We introduce a new class of Eulerian posets, called S-partitionable posets, which have a non-negative cd-index. These posets are a generalization of S-shellable complexes introduced by Stanley in 1994. We prove that S-partitionable posets…

Combinatorics · Mathematics 2026-02-04 Felipe Caster , Dan Guyer , José Alejandro Samper

We prove Tamura's theorem on partitions of the set of positive integers (a generalization of the more famous Rayleigh-Beatty theorem) using the positive $\mathbb{S}^1$-equivariant symplectic homology.

Symplectic Geometry · Mathematics 2023-06-19 Igor Uljarevic

We characterize stability under composition, inversion, and solution of ordinary differential equations for ultradifferentiable classes, and prove that all these stability properties are equivalent.

Classical Analysis and ODEs · Mathematics 2016-03-03 Armin Rainer , Gerhard Schindl

We provide a natural interpretation of the secondary Euler characteristic and introduce higher Euler characteristics. For a compact oriented manifold of odd dimension, the secondary Euler characteristic recovers the Kervaire…

K-Theory and Homology · Mathematics 2015-09-18 Niranjan Ramachandran

An $(n,k)$-Sperner partition system is a set of partitions of some $n$-set such that each partition has $k$ nonempty parts and no part in any partition is a subset of a part in a different partition. The maximum number of partitions in an…

Combinatorics · Mathematics 2020-10-22 Adam Gowty , Daniel Horsley