English
Related papers

Related papers: A Combinatorial Formula for Rank 2 Cluster Variabl…

200 papers

The article considers arrowhead and diagonal-plus-rank-one matrices in F^(nxn) where F in R,C or H. H is a non-commutative field of quaternions. We give unified formulas for fast matrix-vector multiplications, determinants, and inverses for…

Numerical Analysis · Mathematics 2022-12-22 Nevena Jakovcevic Stor , Ivan Slapnicar

In this article, we carry out the investigation for regular sequences of symmetric polynomials in the polynomial ring in three and four variable. Any two power sum element in $\mathbb{C}[x_1,x_2,...,x_n]$ for $n \geq 3$ always form a…

Commutative Algebra · Mathematics 2013-03-26 Neeraj Kumar , Ivan Martino

A filtration of a representation whose successive quotients are isomorphic to Demazure modules is called an excellent filtration. In this paper we study graded multiplicities in excellent filtrations of fusion products for the current…

Representation Theory · Mathematics 2022-09-20 Rekha Biswal , Deniz Kus

Using the correspondence between a cycle up-down permutation and a pair of matchings, we give a combinatorial proof of the enumeration of alternating permutations according to the given peak set.

Combinatorics · Mathematics 2012-04-06 Alina F. Y. Zhao

An interval in a combinatorial structure S is a set I of points which relate to every point from S I in the same way. A structure is simple if it has no proper intervals. Every combinatorial structure can be expressed as an inflation of a…

Combinatorics · Mathematics 2014-01-14 Robert Brignall , Nik Ruskuc , Vince Vatter

The factorizations of the polynomial $X^n-1$ and the cyclotomic polynomial $\Phi_n$ over a finite field $\mathbb F_q$ have been studied for a very long time. Explicit factorizations have been given for the case that $\mathrm{rad}(n)\mid…

Number Theory · Mathematics 2024-02-09 Anna-Maurin Graner

For each positive integer n greater than or equal to 2, a new approach to expressing real numbers as sequences of nonnegative integers is given. The n=2 case is equivalent to the standard continued fraction algorithm. For n=3, it reduces to…

Number Theory · Mathematics 2007-05-23 Thomas Garrity

Two general methods for establishing the logarithmic behavior of recursively defined sequences of real numbers are presented. One is the interlacing method, and the other one is based on calculus. Both methods are used to prove logarithmic…

Combinatorics · Mathematics 2007-05-23 Tomislav Došlić , Darko Veljan

We study arithmetical and combinatorial properties of $\beta$-integers for $\beta$ being the root of the equation $x^2=mx-n, m,n \in \mathbb N, m \geq n+2\geq 3$. We determine with the accuracy of $\pm 1$ the maximal number of…

Discrete Mathematics · Computer Science 2007-05-23 Lubomíra Balková , Edita Pelantová , Ondřej Turek

Let $X$ be a random variable that takes its values in $\frac{1}{q}\mathbb{Z}$, for some integer $q\ge2$, and consider $X$ rounded to an integer, either downwards or upwards or to the nearest integer. We give general formulas for the…

Probability · Mathematics 2025-04-10 Svante Janson

In this paper, we consider the problem of computing the rank of a block-structured symbolic matrix (a generic partitioned matrix) $A = (A_{\alpha \beta} x_{\alpha \beta})$, where $A_{\alpha \beta}$ is a $2 \times 2$ matrix over a field…

Combinatorics · Mathematics 2021-06-23 Hiroshi Hirai , Yuni Iwamasa

In this paper we develop a classification of real functions based on growth rates of repeated iteration. We show how functions are naturally distinguishable when considering inverses of repeated iterations. For example, $n+2\to 2n\to 2^n\to…

Classical Analysis and ODEs · Mathematics 2024-09-11 Titus Hilberdink

For any positive integer $n$ along with parameters $\alpha$ and $\nu$, we define and investigate $\alpha$-shifted, $\nu$-offset, floor sequences of length $n$. We find exact and asymptotic formulas for the number of integers in such a…

Number Theory · Mathematics 2022-08-17 Nicholas Dent , Caleb M. Shor

We show that sequences of positive integers whose ratios $a_n^2/a_{n+1}$ lie within a specific range are almost uniquely determined by their reciprocal sums. For instance, the Sylvester sequence is uniquely characterized as the only…

Number Theory · Mathematics 2025-04-09 Junnosuke Koizumi

In this paper, we make a conjecture (conjecture 1) related to the Bateman-Horn conjecture and proceed to study the roots of $x^2+1$ and $x^2+2$ to prime moduli, assuming the truth of the Bateman-Horn conjecture and conjecture 1 and using…

Number Theory · Mathematics 2012-10-04 Timothy Foo

In this paper, we provide a combinatorial interpretation for Laurent polynomials obtained by iteratively mutating a certain periodic quiver that has been framed with frozen vertices. This yields a family of cluster variables with principal…

Combinatorics · Mathematics 2026-02-24 Qiyue Chen , Gregg Musiker

Let $n$ be a positive integer, and define the rational function $S(x_1,\ldots,x_{2n})$ as the permanent of the matrix $[x_{j,k}]_{1\le j,k\le 2n}$, where $$x_{j,k}=\begin{cases}(x_j+x_k)/(x_j-x_k)&\text{if}\ j\not=k,\\1&\text{if}\…

Combinatorics · Mathematics 2022-09-16 Yue-Feng She , Zhi-Wei Sun , Wei Xia

Let $\mathcal{C}$ be a Hom-finite triangulated 2-Calabi-Yau category with a cluster tilting object. Under some constructibility assumptions on $\mathcal{C}$ which are satisfied for instance by cluster categories, by generalized cluster…

Representation Theory · Mathematics 2014-02-26 Yann Palu

The ring of dual numbers over a ring $R$ is $R[\alpha] = R[x]/(x^2)$, where $\alpha$ denotes $x+(x^2)$. For any finite commutative ring $R$, we characterize null polynomials and permutation polynomials on $R[\alpha]$ in terms of the…

Commutative Algebra · Mathematics 2021-10-07 H. Al-Ezeh , A. A. Al-Maktry , S. Frisch

Many applications of automated deduction require reasoning in first-order logic modulo background theories, in particular some form of integer arithmetic. A major unsolved research challenge is to design theorem provers that are "reasonably…

Logic in Computer Science · Computer Science 2019-04-18 Peter Baumgartner , Uwe Waldmann
‹ Prev 1 8 9 10 Next ›