Related papers: The multiplicative inequality for class degrees vi…
We prove specific biases in the number of occurrences of parts belonging to two different residue classes $a$ and $b$, modulo a fixed non-negative integer $m$, for the sets of unrestricted partitions, partitions into distinct parts, and…
We introduce a new approach to an enumerative problem closely linked with the geometry of branched coverings; that is, we study the number of ways a permutation can be decomposed into a product of a given number of 2-cycles, 3-cycles, etc.…
Factorization models express a statistical object of interest in terms of a collection of simpler objects. For example, a matrix or tensor can be expressed as a sum of rank-one components. However, in practice, it can be challenging to…
We study finite-state transducers and their power for transforming infinite words. Infinite sequences of symbols are of paramount importance in a wide range of fields, from formal languages to pure mathematics and physics. While finite…
In this note, we describe a family of particular algebraic, and nonquadratic, power series over an arbitrary finite field of characteristic 2, having a continued fraction expansion with all partial quotients of degree one. The main purpose…
In this paper, we construct certain infinite families of imaginary quadratic fields whose class number is divisible by a given positive integer.
We introduce classes of graphs with bounded expansion as a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, the greatest reduced average density (grad) of G with rank…
Periodic-finite-type shifts (PFT's) form a class of sofic shifts that strictly contains the class of shifts of finite type (SFT's). In this paper, we investigate how the notion of "period" inherent in the definition of a PFT causes it to…
In this paper we define a degree for ends of infinite digraphs. The well-definedness of our definition in particular resolves a problem by Zuther. Furthermore, we extend our notion of end degree to also respect, among others, the vertices…
In this paper, we introduce relative LS category of a map and study some of its properties. Then we introduce `higher topological complexity' of a map, a homotopy invariant. We give a cohomological lower bound and compare it with previously…
Many results have been established that show how the number of conjugacy classes appearing in the product of classes affect the structure of a finite group. The aim of this paper is to show several results about solvability concerning the…
Individual scores on common factors are required in some applied settings (e.g., business and marketing settings). Common factors are based on reflective indicators, but their scores cannot unambiguously be determined. Therefore, factor…
In the first part of this note, we review and compare various instances of the notion of twisted coefficient system, a.k.a. polynomial functor, appearing in the literature. This notion hinges on how one defines the degree of a functor from…
Let $G$ be a simple graph and $v$ be a vertex of $G$. The triangle-degree of $v$ in $G$ is the number of triangles that contain $v$. While every graph has at least two vertices with the same degree, there are graphs in which every vertex…
This paper investigates the p-adic valuation trees of degree-2 and degree-3 polynomials in two variables over any prime p, building upon prior research outlined in [14].
We consider a class of linear ODEs of second order with variable coefficients and construct its Lie algebra of Lie group of equivalence transformations. Further we find invariants and differential invariants of this Lie algebra and by using…
This paper develops a technique allowing one to prove the convergence of a class of series of multiple integrals which corresponds to the form factor expansion of two-point functions in the 1+1 dimensional massive integrable Sinh-Gordon…
We investigate the joint distribution of the vertex degrees in three models of random bipartite graphs. Namely, we can choose each edge with a specified probability, choose a specified number of edges, or specify the vertex degrees in one…
We introduce proof terms for string rewrite systems and, using these, show that various notions of equivalence on reductions known from the literature can be viewed as different perspectives on the notion of causal equivalence. In…
A clone of functions on a finite domain determines and is determined by its system of invariant relations (=predicates). When a clone is determined by a finite number of relations, we say that the clone is of finite degree. For each Minsky…