中文
相关论文

相关论文: On rank functions for heaps

200 篇论文

Let $p$ be an odd prime, let $N$ be a prime with $N \equiv 1 \pmod{p}$, and let $\zeta_p$ be a primitive $p$-th root of unity. We study the $p$-rank of the class group of $\mathbb{Q}(\zeta_p, N^{1/p})$ using Galois cohomological methods and…

We define, for any special matching of a finite graded poset, an idempotent, regressive and order preserving function. We consider the monoid generated by such functions. The idempotents of this monoid are called special idempotents. They…

组合数学 · 数学 2021-05-20 P. Sentinelli

Tensors, or multi-linear forms, are important objects in a variety of areas from analytics, to combinatorics, to computational complexity theory. Notions of tensor rank aim to quantify the "complexity" of these forms, and are thus also…

计算复杂性 · 计算机科学 2023-06-16 Mandar Juvekar , Arian Nadjimzadah

In [Mulmuley, 1987], Mulmuley gave an algorithm reducing the computation of the matrix rank function to that of determinants, of which the proof for the verification is elementary. In this article, we formalize this argument in the bounded…

计算机科学中的逻辑 · 计算机科学 2025-08-20 Eitetsu Ken , Satoru Kuroda

We compute the cohomology with group ring coefficients of the complement of a finite collection of affine hyperplanes in a finite dimensional complex vector space. It is nonzero in exactly one degree, namely the degree equal to the rank of…

代数拓扑 · 数学 2010-02-23 Michael W Davis , Tadeusz Januszkiewicz , Ian J Leary , Boris Okun

In this work we provide theoretical estimates for the ranks of the power functions $f(k) = k^{-\alpha}$, $\alpha>1$ in the quantized tensor train (QTT) format for $k = 1, 2, 3, \ldots, 2^{d}$. Such functions and their several…

数值分析 · 数学 2025-01-20 Sergey A. Matveev , Matvey Smirnov

We study three different poset structures on the set of all compositions. In the first case, the covering relation consists of inserting a part of size one to the left or to the right, or increasing the size of some part by one. The…

组合数学 · 数学 2007-05-23 Jan Snellman

In this thesis, we study the combinatorics of cyclically fully commutative elements in Coxeter groups of type $A$ as it relates to conjugacy. In particular, we introduce the notion of cylindrical heaps and ring equivalence in order to state…

组合数学 · 数学 2015-06-24 Brooke Fox

Chapuy and Stump have given a nice generating series for the number of factorisations of a Coxeter element as a product of reflections. Their method is to evaluate case by case a character-theoretic expression. The goal of this note is to…

表示论 · 数学 2014-08-05 Jean Michel

We use pseudodeformation theory to study Mazur's Eisenstein ideal. Given prime numbers $N$ and $p>3$, we study the Eisenstein part of the $p$-adic Hecke algebra for $\Gamma_0(N)$. We compute the rank of this Hecke algebra (and, more…

数论 · 数学 2020-02-12 Preston Wake , Carl Wang-Erickson

We prove a simple formula for arbitrary cluster variables in the marked surfaces model. As part of the formula, we associate a labeled poset to each tagged arc, such that the associated $F$-polynomial is a weighted sum of order ideals. Each…

组合数学 · 数学 2024-04-19 Vincent Pilaud , Nathan Reading , Sibylle Schroll

We exhibit an infinite family of vector-valued mock theta functions indexed by positive integers coprime to $6$. These are built from specializations of Dyson's rank generating function and related functions studied by Watson, Gordon, and…

数论 · 数学 2022-12-19 Nickolas Andersen , Clayton Williams

In this paper we consider generalized moment functions of higher order. These functions are closely related to the well-known functions of binomial type which have been investigated on various abstract structures. In our former paper we…

组合数学 · 数学 2022-04-19 Żywilla Fechner , Eszter Gselmann , László Székelyhidi

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

In this master thesis we analyze the complexity of sorting a set of strings. It was shown that the complexity of sorting strings can be naturally expressed in terms of the prefix trie induced by the set of strings. The model of computation…

数据结构与算法 · 计算机科学 2014-08-26 Igor Stassiy

We introduce a new concept of rank - relative rank associated to a filtered collection of polynomials. When the filtration is trivial our relative rank coincides with Schmidt rank (also called strength). We also introduce the notion of…

交换代数 · 数学 2024-03-07 Amichai Lampert , Tamar Ziegler

We study the general and connected stable ranks for C*-algebras. We estimate these ranks for pullbacks of C*-algebras, and for tensor products by commutative C*-algebras. Finally, we apply these results to determine these ranks for certain…

算子代数 · 数学 2018-06-26 Prahlad Vaidyanathan

We revisit Schmidt's theorem connecting the Schmidt rank of a tensor with the codimension of a certain variety and adapt the proof to the case of arbitrary characteristic. We also find a sharper result of this kind for homogeneous…

代数几何 · 数学 2023-02-21 David Kazhdan , Amichai Lampert , Alexander Polishchuk

We study finitely generated models of countable theories, having at most countably many nonisomorphic finitely generated models. We intro- duce a notion of rank of finitely generated models and we prove, when T has at most countably many…

逻辑 · 数学 2008-04-21 Abderezak Ould Houcine

We develop a theory of polymatroids on Stallings core graphs, which provides a new technique for proving lower bounds on stable invariants of words and subgroups in free groups $F$, and for upper bounds on their probability for mapping,…

群论 · 数学 2026-01-05 Yotam Shomroni