中文
相关论文

相关论文: Containment in (s,t)-core Partitions

200 篇论文

We investigate theoretically whether it is feasible to detect $\eta$- and $\omega$-nucleus bound states. As well as the closed shell nuclei, $^{16}$O, $^{40}$Ca, $^{90}$Zr and $^{208}$Pb, we also investigate $^6$He, $^{11}$B and $^{26}$Mg,…

核理论 · 物理学 2010-02-17 K. Tsushima , D. H. Lu , A. W. Thomas , K. Saito

Motivated by a recent paper of Straub, we study the distribution of integer partitions according to the length of their largest hook, instead of the usual statistic, namely the size of the partitions. We refine Straub's analogue of Euler's…

组合数学 · 数学 2016-04-15 Shishuo Fu , Dazhao Tang

We study computable embeddings for pairs of structures, i.e. for classes containing precisely two non-isomorphic structures. Surprisingly, even for some pairs of simple linear orders, computable embeddings induce a non-trivial degree…

逻辑 · 数学 2023-11-09 Nikolay Bazhenov , Hristo Ganchev , Stefan Vatev

Two graphs $G_1$ and $G_2$ on $n$ vertices are said to pack if there exist injective mappings of their vertex sets into $[n]$ such that the images of their edge sets are disjoint. A longstanding conjecture due to Bollob\'as and Eldridge…

组合数学 · 数学 2016-05-19 Wouter Cames van Batenburg , Ross J. Kang

Given a filter $\Delta$ in the poset of compositions of $n$, we form the filter $\Pi^{*}_{\Delta}$ in the partition lattice. We determine all the reduced homology groups of the order complex of $\Pi^{*}_{\Delta}$ as ${\mathfrak…

组合数学 · 数学 2016-06-07 Richard Ehrenborg , Dustin Hedmark

The Raney numbers $R_{p,r}(k)$ are a two-parameter generalization of the Catalan numbers. In this paper, we obtain a recurrence relation for the Raney numbers which is a generalization of the recurrence relation for the Catalan numbers.…

组合数学 · 数学 2015-12-29 Robin DaPao Zhou

In this paper we collect some open set-theoretic problems that appear in the large-scale topology (called also Asymptology). In particular we ask problems about critical cardinalities of some special (large, indiscrete, inseparated) coarse…

一般拓扑 · 数学 2021-11-10 Taras Banakh , Igor Protasov

We study the simultaneous embeddability of a pair of partitions of the same underlying set into disjoint blocks. Each element of the set is mapped to a point in the plane and each block of either of the two partitions is mapped to a region…

计算几何 · 计算机科学 2014-08-27 Jan Christoph Athenstädt , Tanja Hartmann , Martin Nöllenburg

Given $0<\alpha<1$, the Beatty sequence of density $\alpha$ is the sequence $B_{\alpha}=(\lfloor n/\alpha\rfloor)_{n\in\mathbb{N}}$. Beatty's theorem states that if $\alpha,\beta$ are irrational numbers with $\alpha+\beta=1$, then the…

数论 · 数学 2019-07-23 A. J. Hildebrand , Junxian Li , Xiaomin Li , Yun Xie

We prove various inequalities between the number of partitions with the bound on the largest part and some restrictions on occurrences of parts. We explore many interesting consequences of these partition inequalities. In particular, we…

组合数学 · 数学 2017-08-08 Alexander Berkovich , Ali K. Uncu

Using a central limit theorem for arrays of interacting quantum systems, we give analytical expressions for the density of states and the partition function at finite temperature of such a system, which are valid in the limit of infinite…

统计力学 · 物理学 2009-11-10 Michael Hartmann , Guenter Mahler , Ortwin Hess

For the random 2-SAT formula $F(n,p)$, let $F_C (n,p)$ be the formula left after the pure literal algorithm applied to $F(n,p)$ stops. Using the recently developed Poisson cloning model together with the cut-off line algorithm (COLA), we…

组合数学 · 数学 2008-08-13 Jeong Han Kim

The problem Defensive $\delta$-Covering, for some covering range $\delta > 0$, is a continuous facility location problem on undirected graphs where all edges have unit length. It is a generalization of Defensive Dominating Set and…

计算复杂性 · 计算机科学 2026-05-12 Christoph Grüne , Tom Janßen

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…

一般拓扑 · 数学 2008-02-28 Jerzy Dydak

We study the extent to which divisors of a typical integer $n$ are concentrated. In particular, defining the Erd\H{o}s-Hooley $\Delta$-function by $\Delta(n) := \max_t \# \{d | n, \log d \in [t,t+1]\}$, we show that $\Delta(n) \geq (\log…

数论 · 数学 2023-11-01 Kevin Ford , Ben Green , Dimitris Koukoulopoulos

The integer $\beta (\rho, v, k)$ is defined to be the maximum number of blocks in any $(v, k)$-packing in which the maximum partial parallel class (or PPC) has size $\rho$. This problem was introduced and studied by Stinson for the case…

组合数学 · 数学 2022-02-15 Douglas R. Stinson , Ruizhong Wei

Folsom, Kent, and Ono used the theory of modular forms modulo $\ell$ to establish remarkable ``self-similarity'' properties of the partition function and give an overarching explanation of many partition congruences. We generalize their…

数论 · 数学 2015-10-06 Eva Belmont , Holden Lee , Alexandra Musat , Sarah Trebat-Leder

Some of the most spectacular failures of density-functional and Hartree-Fock theories are related to an incorrect description of the so-called static electron correlation. Motivated by recent progress on the N-representability problem of…

The tangled closure of a collection of subsets of a topological space is the largest subset in which each member of the collection is dense. This operation models a logical `tangle modality' connective, of significance in finite model…

逻辑 · 数学 2018-11-08 Robert Goldblatt , Ian Hodkinson

Here we have introduced the ideas of $ (j-i)sg_\kappa^*$-closed sets and a semi generalized closed set in a bispace; $ i,j=1,2; i\not=j $ and then have studied on pairwise semi $T_0 $-axiom, pairwise semi $T_1 $-axiom and pairwise semi…

一般拓扑 · 数学 2021-02-16 Jagannath Pal , Amar Kumar Banerjee