Related papers: Ansatz in a Nutshell: A comprehensive step-by-step…
C. F. Gauss discovered a beautiful formula for the number of irreducible polynomials of a given degree over a finite field. Assuming just a few elementary facts in field theory and the exclusion-inclusion formula, we show how one see the…
Orthogonal polynomials are of fundamental importance in many fields of mathematics and science, therefore the study of a particular family is always relevant. In this manuscript, we present a survey of some general results of the Hermite…
For enumerative problems, i.e. computable functions f from N to Z, we define the notion of an effective (or closed) formula. It is an algorithm computing f(n) in the number of steps that is polynomial in the combined size of the input n and…
We present an overview of the notions of exact sequences of Hopf algebras and tensor categories and their connections. We also present some examples illustrating their main features; these include simple fusion categories and a natural…
We provide a recursive construction of all the semi-Heyting algebras that can be defined on a chain with $n$ elements. This construction allows us to count them easily. We also compare the formula for the number of semi-Heyting chains thus…
An Ulam sequence U(1,n) is defined as the sequence starting with integers 1,n such that n > 1, and such that every subsequent term is the smallest integer that can be written as the sum of distinct previous terms in exactly one way. This…
We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…
We find an asymptotic enumeration formula for the number of simple $r$-uniform hypergraphs with a given degree sequence, when the number of edges is sufficiently large. The formula is given in terms of the solution of a system of equations.…
We present a matrix-theoretic approach for studying and enumerating finite posets through their incidence representations, referred to as poset matrices. Naturally labelled posets are encoded as Boolean lower triangular matrices, allowing a…
In this paper, we investigate how the initial models and the final models for the polynomial functors can be uniformly specified in matching logic.
We consider the problem of recognizing a vocabulary--a collection of words (sequences) over a finite alphabet--from a potential subsequence of one of its words. We assume the given subsequence is received through a deletion channel as a…
In this study, we present two results that relate Tutte polynomials. First, we provide new and complete polynomial invariants for graphs. We note that the number of variables of our polynomials is one. Second, let L_1 and L_2 be two…
A beautiful degree formula for the Grothendieck polynomials was recently given by Pechenik, Speyer, and Weigandt (2021). We provide an alternative proof of their degree formula, utilizing the climbing chain model for Grothendieck…
We introduce a framework that allows for the construction of sequent systems for expressive description logics extending ALC. Our framework not only covers a wide array of common description logics, but also allows for sequent systems to be…
We propose a novel end-to-end neural network architecture that, once trained, directly outputs a probabilistic clustering of a batch of input examples in one pass. It estimates a distribution over the number of clusters $k$, and for each $1…
We use linear algebraic methods to obtain general results about linear operators on a space of polynomials that we apply to the operators associated with a polynomial sequence by the monomiality property. We show that all such operators are…
Provided a special function of one variable and some of its derivatives can be accurately computed over a finite range, a method is presented to build a series of polynomial approximations of the function with a defined relative error over…
Frame theory is an exciting, dynamic and fast paced subject with applications in numerous fields of mathematics and engineering. In this paper we study Continuous Frame and introduce Continuous Frame with $C^{\ast}$-valued bounds. Also, we…
In Lett. Math. Phys. 114, 54 (2024) and 115, 70 (2025), the author introduces what is presented as a novel method for determining whether a sequence of orthogonal polynomials is "classical", based solely on its initial recurrence…
The Hofstadter Q-sequence, with its simple definition, has defied all attempts at analyzing its behavior. Defined by a simple nested recurrence and an initial condition, the sequence looks approximately linear, though with a lot of noise.…