中文
相关论文

相关论文: The direct sum of $q$-matroids

200 篇论文

We define two finite q-analogs of certain multiple harmonic series with an arbitrary number of free parameters, and prove identities for these q-analogs, expressing them in terms of multiply nested sums involving the Gaussian binomial…

组合数学 · 数学 2007-06-13 David M. Bradley

Multilinear representability extends classical linear representability of matroids by assigning subspaces, rather than vectors, to ground elements. This notion is closely related to almost affine codes. In this paper, we introduce and study…

组合数学 · 数学 2026-05-18 Gianira N. Alfarano , Sebastian Degen

Starting from the addition formula for $q$-disk polynomials, which is an identity in non-commuting variables, we establish a basic analogue in commuting variables of the addition and product formula for disk polynomials. These contain as…

量子代数 · 数学 2016-09-06 Paul G. A. Floris , Erik Koelink

The theory of matroids has been generalized to oriented matroids and, recently, to arithmetic matroids. We want to give a definition of "oriented arithmetic matroid" and prove some properties like the "uniqueness of orientation".

组合数学 · 数学 2020-07-20 Roberto Pagaria

This paper is concerned with one-dimensional sums in classical affine types. We prove a conjecture of the third author and Zabrocki by showing they all decompose in terms of one-dimensional sums related to affine type A provided the rank of…

量子代数 · 数学 2011-05-10 Cedric Lecouvey , Masato Okado , Mark Shimozono

We developpe a direct sum decomposition for n-dual spaces.

泛函分析 · 数学 2007-05-23 Javier H. Guachalla

A Direct Sum Theorem holds in a model of computation, when solving some k input instances together is k times as expensive as solving one. We show that Direct Sum Theorems hold in the models of deterministic and randomized decision trees…

计算复杂性 · 计算机科学 2010-04-02 Rahul Jain , Hartmut Klauck , Miklos Santha

We consider the problem of determining whether the union of two infinite matroids is a matroid. We introduce a superclass of the finitary matroids, the nearly finitary matroids, and prove that the union of two nearly finitary matroids is a…

组合数学 · 数学 2012-07-10 Elad Aigner-Horev , Johannes Carmesin , Jan-Oliver Fröhlich

A sum-of-squares is a polynomial that can be expressed as a sum of squares of other polynomials. Determining if a sum-of-squares decomposition exists for a given polynomial is equivalent to a linear matrix inequality feasibility problem.…

最优化与控制 · 数学 2013-03-07 Peter Seiler , Qian Zheng , Gary Balas

By applying Chinese remainder theorem for coprime polynomials and the "creative microscoping" method recently introduced by the author and Zudilin, we establish parametric generalizations of three $q$-supercongruences modulo the fourth…

数论 · 数学 2019-12-03 Victor J. W. Guo

In this preprint we discuss a definition of a $q$-ary graph. Furthermore, we describe how to make an incidence matrix for it, with an eye on the corresponding $q$-matroid.

组合数学 · 数学 2026-05-26 Michela Ceria , Relinde Jurrius

We discuss the inequalities for $q$-integrals because of the fact that the inequalities can be very useful in the future mathematical research. Since $q$-integral of a function over an interval $[a,b]$ is defined by the difference of two…

经典分析与常微分方程 · 数学 2007-05-23 Predrag M. Rajkovic , Sladjana D. Marinkovic , Miomir S. Stankovic

In this paper we establish a $q$-analogue of a congruence of Sun concerning the products of binomial coefficients modulo the square of a prime.

组合数学 · 数学 2007-05-23 Hao Pan , Hui-Qin Cao

We define the equivariant Kazhdan-Lusztig polynomial of a matroid equipped with a group of symmetries, generalizing the nonequivariant case. We compute this invariant for arbitrary uniform matroids and for braid matroids of small rank.

组合数学 · 数学 2016-11-23 Katie Gedeon , Nicholas Proudfoot , Ben Young

In this paper we develop the theory of cyclic flats of $q$-matroids. We show that the lattice of cyclic flats, together with their ranks, uniquely determines a $q$-matroid and hence derive a new $q$-cryptomorphism. We introduce the notion…

组合数学 · 数学 2023-02-15 Gianira N. Alfarano , Eimear Byrne

We construct some matroids that have a circuit and a cocircuit with infinite intersection. This answers a question of Bruhn, Diestel, Kriesell, Pendavingh and Wollan. It further shows that the axiom system for matroids proposed by Dress…

组合数学 · 数学 2012-02-29 Johannes Carmesin , Nathan Bowler

Rough set is mainly concerned with the approximations of objects through an equivalence relation on a universe. Matroid is a combinatorial generalization of linear independence in vector spaces. In this paper, we define a parametric set…

人工智能 · 计算机科学 2012-09-25 Yanfang Liu , William Zhu

We prove a conjecture that arose in the context of a subspace enumeration problem over finite fields. We prove, more generally, a bibasic, double-sum identity, which extends a $q$-analogue of the (terminating) binomial theorem.

组合数学 · 数学 2026-05-05 Gaurav Bhatnagar , Amritanshu Prasad

An ansatz is proposed for heptagon relation, that is, algebraic imitation of five-dimensional Pachner move 4--3. Our relation is realized in terms of matrices acting in a direct sum of one-dimensional linear spaces corresponding to 4-faces.

量子代数 · 数学 2022-08-09 Igor G. Korepanov

This paper is devoted to the study of $$ U_t(a,q):=\sum_{1\leq n_1<n_2<\cdots<n_t}\frac{q^{n_1+n_2+\cdots+n_t}}{(1+aq^{n_1}+q^{2n_1})(1+aq^{n_2}+q^{2n_2})\cdots(1+aq^{n_t}+q^{2n_t})} $$ when $a$ is one of $0, \pm 1, \pm2$. The idea builds…

数论 · 数学 2024-10-01 Tewodros Amdeberhan , George E. Andrews , Roberto Tauraso