中文
相关论文

相关论文: Divisibility orders in $\beta N$

200 篇论文

We show that several versions of Floyd and Rivest's algorithm Select for finding the $k$th smallest of $n$ elements require at most $n+\min\{k,n-k\}+o(n)$ comparisons on average and with high probability. This rectifies the analysis of…

数据结构与算法 · 计算机科学 2007-05-23 Krzysztof C. Kiwiel

Let x be an element of a group G. For a positive integer n let E_n(x) be the subgroup generated by all commutators [...[[y,x],x],...,x] over y in G, where x is repeated n times. There are several recent results showing that certain…

群论 · 数学 2017-07-20 Pavel Shumyatsky

An antichain $\mathcal{A}$ in a poset $\mathcal{P}$ is a subset of $\mathcal{P}$ in which no two elements are comparable. Sperner showed that the maximal antichain in the Boolean lattice, $\mathcal{B}_n = \left\{ 0 < 1 \right\}^n$, is the…

组合数学 · 数学 2019-01-07 Larry H. Harper , Gene B. Kim

In classical set theory, the ordinals form a linear chain that we often think of as a very thin portion of the set-theoretic universe. In intuitionistic set theory, however, this is not the case and there can be incomparable ordinals. In…

逻辑 · 数学 2026-05-26 Shuwei Wang

Let A_n be the alternating group on n letters. For n>5, we describe the elements alpha, beta in A_n when alpha^{A_n} beta^{A_n} is the union of at most four distinct conjugacy classes.

群论 · 数学 2009-06-16 Edith Adan-Bante , John Harris , Helena Verrill

In this paper, the class of all linearly ordered topological spaces (LOTS) quasi-ordered by the embeddability relation is investigated. In ZFC it is proved that for countable LOTS this quasi-order has both a maximal (universal) element and…

逻辑 · 数学 2011-02-11 Alex Primavesi , Katherine Thompson

The structure of the Wadge degrees on zero-dimensional spaces is very simple (almost well-ordered), but for many other natural non-zero-dimensional spaces (including the space of reals) this structure is much more complicated. We consider…

逻辑 · 数学 2019-02-20 Luca Motto Ros , Philipp Schlicht , Victor Selivanov

For an element $g$ in a group $X$, we say that $g$ has 2-part order $2^{a}$ if $2^{a}$ is the largest power of 2 dividing the order of $g$. We prove lower bounds on the proportion of elements in finite classical groups in odd characteristic…

群论 · 数学 2012-05-09 Simon Guest , Cheryl E. Praeger

We analyze in detail supersymmetry breaking by compactification of the fifth dimension in M-theory in the compactification pattern $11d \to 5d \to 4d$ and find that a superpotential is generated for the complex fields coming from $5d$…

高能物理 - 理论 · 物理学 2009-10-30 Emilian Dudas

The Dushnik--Miller dimension of a poset $P$ is the least $d$ for which $P$ can be embedded into a product of $d$ chains. Lewis and Souza showed that the dimension of the divisibility order on the interval of integers $[N/\kappa, N]$ is…

组合数学 · 数学 2023-11-15 Milan Haiman

In their work on `Coxeter-like complexes', Babson and Reiner introduced a simplicial complex $\Delta_T$ associated to each tree $T$ on $n$ nodes, generalizing chessboard complexes and type A Coxeter complexes. They conjectured that…

组合数学 · 数学 2008-09-16 Patricia Hersh

We consider the posets of equivalence relations on finite sets under the standard embedding ordering and under the consecutive embedding ordering. In the latter case, the relations are also assumed to have an underlying linear order, which…

组合数学 · 数学 2024-02-12 V. Ironmonger , N. Ruskuc

An ordered set-partition (or preferential arrangement) of n labeled elements represents a single ``hierarchy''; these are enumerated by the ordered Bell numbers. In this note we determine the number of ``hierarchical orderings'' or…

组合数学 · 数学 2014-09-17 N. J. A. Sloane , Thomas Wieder

This is the second of two papers investigating for which positive integers $m$ there exists a maximal antichain of size $m$ in the Boolean lattice $B_n$ (the power set of $[n]:=\{1,2,\dots,n\}$, ordered by inclusion). In the first part, the…

组合数学 · 数学 2024-07-01 Jerrold R. Griggs , Thomas Kalinowski , Uwe Leck , Ian T. Roberts , Michael Schmitz

We consider the basic problem of learning an unknown partition of $n$ elements into at most $k$ sets using simple queries that reveal information about a small subset of elements. Our starting point is the well-studied pairwise same-set…

数据结构与算法 · 计算机科学 2025-06-24 Hadley Black , Arya Mazumdar , Barna Saha

For an integer $n\geq 2$, let NCSL$(n)$ denote the set of sizes of congruence lattices of $n$-element semilattices. We find the four largest numbers belonging to NCSL$(n)$, provided that $n$ is large enough to ensure that $|$NCSL$(n)|\geq…

环与代数 · 数学 2018-01-08 Gábor Czédli

The detection of entanglement in a bipartite state is a crucial issue in quantum information science. Based on realignment of density matrices and the vectorization of the reduced density matrices, we introduce a new set of separability…

量子物理 · 物理学 2024-12-09 Yu Lu , Zhong-Xi Shen , Shao-Ming Fei , Zhi-Xi Wang

We study graded rings associated to big divisors on LC pairs whose difference with the log-canonical divisor is nef. For divisors that are positive enough at the LC centers of the pair, we prove the finite generation of such rings if the…

代数几何 · 数学 2014-01-14 Salvatore Cacciola

Given a finite group $G$ of order $n.$ Denote the sum of the inverse-power of element orders in $G$ by $m(G).$ Let $\mathbb{Z}_n$ be the cyclic group of order $n.$ Suppose $G$ is a non-cyclic group of order $n$ then we show that $m(G)\geq…

群论 · 数学 2025-06-17 M. Archita

We study completely syndetic (CS) sets in discrete groups - subsets that for every natural n admit finitely many left translates that jointly cover every n-tuple of group elements. While for finitely-generated groups, the non-virtually…

群论 · 数学 2025-06-24 Guy Salomon , Yotam Svoray , Ariel Yadin