中文
相关论文

相关论文: The Absolute Orders on the Coxeter Groups $A_n$ an…

200 篇论文

Prime-based ordering which is proved to be admissible, is the encoding of indeterminates in power-products with prime numbers and ordering them by using the natural number order. Using Eiffel, four versions of Buchberger's improved…

软件工程 · 计算机科学 2009-01-29 Peter Horan , John Carminati

Solving a decades-old problem we show that Keisler's 1967 order on theories has the maximum number of classes. The theories we build are simple unstable with no nontrivial forking, and reflect growth rates of sequences which may be thought…

逻辑 · 数学 2021-08-12 M. Malliaris , S. Shelah

Let $k$ be a field of characteristic $0$, let $\mathsf{C}$ be a finite split category, let $\alpha$ be a 2-cocycle of $\mathsf{C}$ with values in the multiplicative group of $k$, and consider the resulting twisted category algebra…

表示论 · 数学 2014-05-06 Robert Boltje , Susanne Danz

We prove that one-relator groups are coherent, solving a well-known problem of Gilbert Baumslag. Our proof strategy is readily applicable to many classes of groups of cohomological dimension two. We show that fundamental groups of…

群论 · 数学 2025-02-05 Andrei Jaikin-Zapirain , Marco Linton

We say that a cyclotomic polynomial \Phi_{n}(x) has order three if n is the product of three distinct primes, p<q<r. Let A(n) be the largest absolute value of a coefficient of \Phi_{n}(x) and M(p) be the maximum of A(pqr). In 1968, Sister…

数论 · 数学 2009-10-16 Jia Zhao , Xianke Zhang

We define combinatorially a partial order on the set partitions and show that it is equivalent to the Bruhat-Chevalley-Renner order on the upper triangular matrices. By considering subposets consisting of set partitions with a fixed number…

组合数学 · 数学 2018-06-12 Mahir Bilen Can , Yonah Cherniavsky

A monoid $M$ generated by a set $S$ of symbols can be described as the set of equivalence classes of finite words in $S$ under some relations that specify when some contiguous sequence of symbols can be replaced by another. If $a,b\in S$, a…

组合数学 · 数学 2011-01-26 Matthew J. Samuel

In this series of three papers, we introduce and study cyclotomic pairs and smooth profinite groups. They are a geometric axiomatisation of Kummer theory for fields, with coefficients $p$-primary roots of unity, for a prime $p$. These…

代数几何 · 数学 2025-03-19 Charles De Clercq , Mathieu Florence

We provide a method of constructing better-quasi-orders by generalising a technique for constructing operator algebras that was developed by Pouzet. We then generalise the notion of $\sigma$-scattered to partial orders, and use our method…

逻辑 · 数学 2014-10-02 Gregory McKay

Several important types of categories have been shown to be both exact and coexact (in the sense of Barr). The first type consists of abelian categories, which due to their self-dual definition, can be seen to be both exact and coexact by…

范畴论 · 数学 2026-03-30 James Richard Andrew Gray

In 1967 Herbert Scarf suggested a new proof of Brouwer's fixed point theorem based on a combinatorial analogue of Sperner's lemma. Scarf presented his arguments in very geometric language, even purely combinatorial ones. Recently H. Petri…

代数拓扑 · 数学 2022-07-26 Nikolai V. Ivanov

We prove that certain Fuchsian triangle groups are profinitely rigid in the absolute sense, i.e. each is distinguished from all other finitely generated, residually finite groups by its set of finite quotients. We also develop a method…

群论 · 数学 2021-10-04 M. R. Bridson , D. B. McReynolds , A. W. Reid , R. Spitler

L\'evai and Pyber proposed the following as a conjecture: Let $G$ be a profinite group such that the set of solutions of the equation $x^n=1$ has positive Haar measure. Then $G$ has an open subgroup $H$ and an element $t$ such that all…

The basic result of this note is a statement about the existence of families of partitions of the set of natural numbers with some favourable properties, the n-optimal matrices of partitions. We use this to improve a decomposition result…

逻辑 · 数学 2010-05-28 Gido Scharfenberger-Fabian

This paper studies the complexity of query evaluation for databases whose relations are partially ordered; the problem commonly arises when combining or transforming ordered data from multiple sources. We focus on queries in a useful…

数据库 · 计算机科学 2019-05-30 Antoine Amarilli , Mouhamadou Lamine Ba , Daniel Deutch , Pierre Senellart

A result of Pyber states that every finite group $G$ contains an abelian subgroup whose order is quasi-polynomially large in $\lvert G\rvert$. We prove a similar result for $K$-approximate subgroups of solvable groups under only modest…

组合数学 · 数学 2025-12-18 Carl Schildkraut

A quotient of a poset $P$ is a partial order obtained on the equivalence classes of an equivalence relation $\theta$ on $P$; $\theta$ is then called a congruence if it satisfies certain conditions, which vary according to different…

组合数学 · 数学 2025-08-20 Nicholas J. Williams

By a result known as Rieger's theorem (1956), there is a one-to-one correspondence, assigning to each cyclically ordered group $H$ a pair $(G,z)$ where $G$ is a totally ordered group and $z$ is an element in the center of $G$, generating a…

逻辑 · 数学 2013-11-05 Michèle Giraudet , Gérard Leloup , Francois Lucas

Let $m$ be a positive integer and let $\rho(m,n)$ be the proportion of permutations of the symmetric group ${\rm Sym}(n)$ whose order is coprime to $m$. In 2002, Pouyanne proved that $\rho(n,m)n^{1-\frac{\phi(m)}{m}}\sim \kappa_m$ where…

组合数学 · 数学 2019-04-19 John Bamberg , S. P. Glasby , Scott Harper , Cheryl E. Praeger

In this paper, we introduce the notion of (strictly) semimonotone matrices of exact order $k$, where $0\leq k\leq n$, and explore their properties. We fully characterize the $3 \times 3$ (strictly) semimonotone matrices of exact order $2$,…

最优化与控制 · 数学 2026-03-03 Bharat Pratap Chauhan , Dipti Dubey
‹ 上一页 1 8 9 10 下一页 ›