Related papers: Inversion of integral series enumerating planar tr…
An integro-differential Dirac system with an integral term in the form of convolution is considered. We suppose that the convolution kernel is known a priori on a part of the interval, and recover it on the remaining part, using a part of…
Let $W$ be a Coxeter group, and for $u,v\in W$, let $R_{u,v}(q)$ be the Kazhdan-Lusztig $R$-polynomial indexed by $u$ and $v$. In this paper, we present a combinatorial proof of the inversion formula on $R$-polynomials due to Kazhdan and…
This paper studies tree-automatic ordinals (or equivalently, well-founded linearly ordered sets) together with the ordinal addition operation +. Informally, these are ordinals such that their elements are coded by finite trees for which the…
Let $W$ be a finite reflection group. For a given $w \in W$, the following assertion may or may not be satisfied: (*) The principal Bruhat order ideal of $w$ contains as many elements as there are regions in the inversion hyperplane…
In this work we continue to study the properties of polynomials of binomial type and their canonical continuations to the complex index by exploring the properties of transformation T:=1/dlog which acts on formal power series $f(x)$ of the…
The independence polynomial of a graph $G$ is \[I(G,x)=\sum\limits_{k\ge 0}i_k(G)x^k,\] where $i_k(G)$ denotes the number of independent sets of $G$ of size $k$ (note that $i_0(G)=1$). In this paper we show a new method to prove…
Let $\mathbb{Z}_K$ denote the ring of integers of the number field $K = \mathbb{Q}(\theta)$, where $\theta$ is a root of the monic irreducible polynomial $f(x) \in \mathbb{Z}[x]$. We say that $f(x)$ is monogenic if $\mathbb{Z}_K =…
We show that exceptional sequences for hereditary algebras are characterized by the fact that the product of the corresponding reflections is the inverse Coxeter element in the Weyl group. We use this result to give a new combinatorial…
We present a complete classification of elements in the mapping class group of the torus which have a representative that can be written as a product of two orientation reversing involutions. Our interest in such decompositions is motivated…
It implicitly follows from the work of [Colbourn, El-Mallah: On two dual classes of planar graphs. Discrete Mathematics 80(1): 21-40 (1990)] that every planar partial 3-tree is a subgraph of a planar 3-tree. This fact has already enabled to…
Let $K$ be an {\em arbitrary} field of characteristic $p>0$, let $A$ be one of the following algebras: $P_n:= K[x_1, ..., x_n]$ is a polynomial algebra, $\CD (P_n)$ is the ring of differential operators on $P_n$, $\CD (P_n)\t P_m$, the…
We show that families of action graphs, with initial graphs which are linear of varying length, give rise to self-convolutions of the Catalan sequence. We prove this result via a comparison with planar rooted forests with a fixed number of…
We present a generic tree-interpolation algorithm in the SMT context with quantifiers. The algorithm takes a proof of unsatisfiability using resolution and quantifier instantiation and computes interpolants (which may contain quantifiers).…
The algebraic theory of third-order tensors under the $t$-product is naturally formulated over the complex field via Fourier block diagonalization. However, many applications require real-valued representations. In this paper, we…
We study connections between self-inversive and self-reciprocal polynomials, reduction theory of binary forms, minimal models of curves, and formally self-dual codes. We prove that if $\mathcal X$ is a superelliptic curve defined over…
We describe birational representations of discrete groups generated by involutions, having their origin in the theory of exactly solvable vertex-models in lattice statistical mechanics. These involutions correspond respectively to two kinds…
We establish analogues for trees of results relating the density of a set $E \subset \mathbb{N}$, the density of its set of popular differences, and the structure of $E$. To obtain our results, we formalise a correspondence principle of…
This paper proves that two differently defined rooted binary trees are isomorphic. The first tree is one associated to a version of Farey sequences where the vertices correspond to the open intervals formed by two successive terms in the…
We introduce a full binary directed tree structure to represent the set of natural numbers, further categorizing them into three distinct subsets: pure odd numbers, pure even numbers, and mixed numbers. We adopt a binary string…
We propose a new topological invariant of unlabeled trees of N nodes. The invariant is a set of Nx2 matrices of integers, with sum_j k^{d_{i,j}} and v_i as the matrix elements, where d_{i,j} are the elements of the distance matrix and v_i…