English
Related papers

Related papers: Exceptional Sequences and Idempotent Functions

200 papers

For a labelled tree on the vertex set $[n]:=\{1,2,..., n\}$, define the direction of each edge $ij$ to be $i\to j$ if $i<j$. The indegree sequence of $T$ can be considered as a partition $\lambda \vdash n-1$. The enumeration of trees with a…

Combinatorics · Mathematics 2009-04-02 Rosena R. X. Du , Jingbin Yin

We opt to study the convergence of maximal real roots of certain Fibonacci-type polynomials given by $G_n=x^kG_{n-1}+G_{n-2}$. The special cases $k=1$ and $k=2$ are found in [4] and [7], respectively.

Number Theory · Mathematics 2008-12-16 Tewodros Amdeberhan

Idempotent Boolean functions form a highly structured subclass of Boolean functions that is closely related to rotation symmetry under a normal-basis representation and to invariance under a fixed linear map in a polynomial basis. These…

Cryptography and Security · Computer Science 2026-02-03 Claude Carlet , Marko Ðurasevic , Domagoj Jakobovic , Luca Mariot , Stjepan Picek

Permutations are usually enumerated by size, but new results can be found by enumerating them by inversions instead, in which case one must restrict one's attention to indecomposable permutations. In the style of the seminal paper by Simion…

Discrete Mathematics · Computer Science 2024-06-25 Atli Fannar Franklín , Anders Claesson , Christian Bean , Henning Úlfarsson , Jay Pantone

This paper studies the uniqueness of two non-constant meromorphic functions when they share a finite set. Moreover, we will give the existence of unique range sets for meromorphic functions that are zero sets of polynomials that do not…

Complex Variables · Mathematics 2021-04-08 Bikash Chakraborty

Trees or rooted trees have been generously studied in the literature. A forest is a set of trees or rooted trees. Here we give recurrence relations between the number of some kind of rooted forest with $k$ roots and that with $k+1$ roots on…

Combinatorics · Mathematics 2017-02-08 Song Guo , Victor J. W. Guo

The Tribonacci sequence $\mathbb{T}$ is the fixed point of the substitution $\sigma(a,b,c)=(ab,ac,a)$. In this note, we get the explicit expressions of all squares, and then establish the tree structure of the positions of repeated squares…

Dynamical Systems · Mathematics 2016-05-17 Yuke Huang , Zhiying Wen

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

This note provides a complete solution to a certain version of the edge-isoperimetric problem for powers of a cycle graph. Namely, it shows that the maximum number of edges inside a vertex subset of $C_n^s$ of size $k$ is achieved by a set…

Combinatorics · Mathematics 2026-01-13 Kristiyan Vasilev

A sequence in the additive group ${\mathbb Z}_n$ of integers modulo $n$ is called $n$-zero-free if it does not contain subsequences with length $n$ and sum zero. The article characterizes the $n$-zero-free sequences in ${\mathbb Z}_n$ of…

Combinatorics · Mathematics 2007-05-23 Svetoslav Savchev , Fang Chen

Ramanujan stated an identity to the effect that if three sequences $\{a_n\}$, $\{b_n\}$ and $\{c_n\}$ are defined by $r_1(x)=:\sum_{n=0}^{\infty}a_nx^n$, $r_2(x)=:\sum_{n=0}^{\infty}b_nx^n$ and $r_3(x)=:\sum_{n=0}^{\infty}c_nx^n$ (here each…

Number Theory · Mathematics 2019-01-16 James Mc Laughlin

Given a nilpotent Lie algebra $\mathfrak n$ we construct a spectral sequence which is derived from a filtration of its Chevalley-Eilenberg differential complex and converges to the Lie algebra cohomology of $\mathfrak n$. The limit of this…

Rings and Algebras · Mathematics 2014-09-25 Viviana J. del Barco

Let $f_1,\cdots,f_r\in k[x_1,\cdots,x_n]$ be homogeneous polynomial of degree $d$. Ananyan and Hochster (2016) proved that there exists a bound $N=N(r,d)$ where if collective strength of $f_1,\cdots,f_r\geq N$, then $f_1,\cdots,f_r$ are…

Commutative Algebra · Mathematics 2021-10-01 Chiahui Cheng

A linear relation $E$ acting on a Hilbert space is idempotent if $E^2=E.$ A triplet of subspaces is needed to characterize a given idempotent: $(\mathrm{ran} \, E, \mathrm{ran}(I-E), \mathrm{dom}\, E),$ or equivalently, $(\mathrm{ker}(I-E),…

Functional Analysis · Mathematics 2022-04-08 Maria Laura Arias , Maximiliano Contino , Alejandra Maestripieri , Stefania Marcantognini

A magic series is a set of natural numbers that, by virtue of its size, sum, and maximum value, could fill a row of a normal magic square. In this paper, we derive an exact two-dimensional integral representation for the number of magic…

Combinatorics · Mathematics 2013-06-05 Michael Quist

We consider a notion of exact sequences in any -not necessarily exact- pointed category relative to a given (E;M)-factorization structure. We apply this notion to introduce and investigate a new notion of exact sequences of semimodules over…

Category Theory · Mathematics 2011-11-03 Jawad Abuhlail

We show that the reciprocal of a partial sum with 2m terms of the alternating exponential series is the exponential generating function for permutations in which every increasing run has length congruent to 0 or 1 modulo 2m. More generally…

Combinatorics · Mathematics 2019-05-21 Ira M. Gessel

In this note we associate a sequence of non-negative integers to any convergent series of positive real numbers and study this sequence for the series $\sum_{n \geq 1} n^{-k}$ where $k$ is an integer $\geq 2$.

Number Theory · Mathematics 2018-07-17 Soumyadip Sahu

Let $\mathbb{A}_n^m$ be an arbitrary $n$-dimensional commutative associative algebra over the field of complex numbers with $m$ idempotents. Let $e_1=1,e_2,\ldots,e_k$ with $2\leq k\leq 2n$ be elements of $\mathbb{A}_n^m$ which are linearly…

Complex Variables · Mathematics 2015-03-25 V. S. Shpakivskyi

A vertex subset of a graph is called a distance-$k$ independent set if the distance between any two of its distinct vertices is at least $k + 1$. For all $n,k \geq 1$, we determine the minimum possible number of inclusion-wise maximal…

Combinatorics · Mathematics 2026-05-01 Dmitrii Taletskii