Related papers: Polylogarithmic functions with prescribed branchin…
We present a proof of polynomial identities related to finite analogues of the branching functions of the coset $\widehat{sl(n)_1} \otimes \widehat{sl(n)_1} / \widehat{sl(n)_2}$.
Let $P_n=k[x_1,x_2,\ldots,x_n]$ be the polynomial algebra over a field $k$ of characteristic zero in the variables $x_1,x_2,\ldots,x_n$ and $\mathscr{L}_n$ be the left-symmetric Witt algebra of all derivations of $P_n$. We describe all…
We analyze the polynomial solutions of the linear differential equation $p_2(x)y''+p_1(x)y'+p_0(x)y=0$ where $p_j(x)$ is a $j^{\rm th}$-degree polynomial. We discuss all the possible polynomial solutions and their dependence on the…
The number of linear independent algebraic relations among elementary symmetric polynomial functions over finite fields is computed. An algorithm able to find all such relations is described. It is proved that the basis of the ideal of…
We consider the number of linear extensions of an N-free order P. We give upper and lower bounds on this number in terms of parameters of the corresponding arc diagram. We propose a dynamic programming algorithm to calculate the number. The…
We give a geometric description of the parabolic bifurcation locus in the space $\operatorname{Rat}_d$ of all rational functions on $\mathbb{P}^1$ of degree $d>1$, generalizing the study by Morton and Vivaldi in the case of monic…
This paper describes an algorithm for determining the branching geometry of algebraic functions. The graphs of these complex-valued functions have a complicated interweaving structure that can be described by analytic branches separated by…
We propose an algebraic model of computation which formally relates symbolic listings, complexity of Boolean functions, and low depth arithmetic circuit complexity. In this model algorithms are arithmetic formula expressing symbolic…
We study the class of functions on the set of (generalized) Young diagrams arising as the number of embeddings of bipartite graphs. We give a criterion for checking when such a function is a polynomial function on Young diagrams (in the…
A classical parking function of length $n$ is a list of positive integers $(a_1, a_2, \ldots, a_n)$ whose nondecreasing rearrangement $b_1 \leq b_2 \leq \cdots \leq b_n$ satisfies $b_i \leq i$. The convex hull of all parking functions of…
Linear differential equations of arbitrary order with polynomial coefficients are considered. Specifically, necessary and sufficient conditions for the existence of polynomial solutions of a given degree are obtained for these equations. An…
Within the framework of mappings between affine spaces, the notion of $n$-th polarization of a function will lead to an intrinsic characterization of polynomial functions. We prove that the characteristic features of derivations, such as…
Satisfiability of Boolean circuits is among the most known and important problems in theoretical computer science. This problem is NP-complete in general but becomes polynomial time when restricted either to monotone gates or linear gates.…
We consider families of symmetric linear programs (LPs) that decide a property of graphs (or other relational structures) in the sense that, for each size of graph, there is an LP defining a polyhedral lift that separates the integer points…
In this paper, we establish three Landau-type theorems for certain bounded poly-analytic functions, which generalize the corresponding result for bi-analytic functions given by Liu and Ponnusamy [Canad. Math. Bull. 67(1): 2024, 152-165].…
We describe the branching of Lie algebras of classical type over $A_{n-1}$ using an inductive approach, which was motivated by the work of Gornitskii. This allows us to label the highest weight vectors of the modules occurring in the…
The branching data of an algebraic function is a list of orders of local monodromies around branching points. We present branching data that ensure that the algebraic functions having them are representable by radicals. This paper is a…
The Macdonald symmetric functions are used to define measures on the set of all partitions of all integers. Probabilistic algorithms are given for growing partitions according to these measures. The case of Hall-Littlewood polynomials is…
Let $f$ be a continuous real function defined in a subset of the real line. The standard definition of continuity at a point $x$ allow us to correlate any given epsilon with a (possibly depending of $x$) delta value. This pairing is known…
In this article we use a method of finding the index of a complex-valued function by determined number of arithmetic operations to describe an algorithm of localization of roots of square-free polynomials. We give an estimation of the…