Related papers: Relations between counting functions on free group…
We prove that the graph of a discontinuous $n$-monomial function $f:\mathbb{R}\to\mathbb{R}$ is either connected or totally disconnected. Furthermore, the discontinuous monomial functions with connected graph are characterized as those…
We compute the variances of sums in arithmetic progressions of arithmetic functions associated with certain $L$-functions of degree two and higher in $\mathbb{F}_q[t]$, in the limit as $q\to\infty$. This is achieved by establishing…
Given a symmetric monoidal $(\infty,n)$-category $\mathcal{C}$ and a space $X$, we address the problem of explicitly describing the symmetric monoidal $(\infty,n)$-category freely obtained from $\mathcal{C}$ by adjoining $X$ new…
We discuss the homological algebra of representation theory of finite dimensional algebras and finite groups. We present various methods for the construction and the study of equivalences of derived categories: local group theory, geometry…
We consider maps between commutative groups and their functional degrees. These degrees are defined based on a simple idea -- the functional degree should decrease if a discrete derivative is taken. We show that the maps of finite…
We prove that, although it is undecidable if a subgroup fixed by an automorphism intersects nontrivially an arbitrary subgroup of $F_n\times F_m$, there is an algorithm that, taking as input a monomorphism and an endomorphism of $F_n\times…
Let $\mathbb{F}\subset \mathbb{K}$ be fields with characteristic zero, $n$ be a positive integer and $\kappa\in \mathbb{K}$. In this paper, we determine those monomials $f\colon \mathbb{F}\to \mathbb{K}$ of degree $n$ for which \[ f(x^{2})=…
We discuss the set of subgroups of the automorphism group of a full shift, and submonoids of its endomorphism monoid. We prove closure under direct products in the monoid case, and free products in the group case. We also show that the…
We consider the complexity of two questions on polynomials given by arithmetic circuits: testing whether a monomial is present and counting the number of monomials. We show that these problems are complete for subclasses of the counting…
Two graphs $G$ and $H$ are homomorphism indistinguishable over a family of graphs $\mathcal{F}$ if for all graphs $F \in \mathcal{F}$ the number of homomorphisms from $F$ to $G$ is equal to the number of homomorphism from $F$ to $H$. Many…
In this paper we study the comparison between the logarithmic and the meromorphic de Rham complexes along a divisor in a complex manifold. We focus on the case of free divisors, starting with the case of locally quasihomogeneous divisors,…
We prove a certain duality relation for orthogonal polynomials defined on a finite set. The result is used in a direct proof of the equivalence of two different ways of computing the correlation functions of a discrete orthogonal polynomial…
Consider a diagram of quasi-categories that admit and functors that preserve limits or colimits of a fixed shape. We show that any weighted limit whose weight is a projective cofibrant simplicial functor is again a quasi-category admitting…
The richly developed theory of complex manifolds plays important roles in our understanding of holomorphic functions in several complex variables. It is natural to consider manifolds that will play similar roles in the theory of holomorphic…
We define tests of boolean functions which distinguish between linear (or quadratic) polynomials, and functions which are very far, in an appropriate sense, from these polynomials. The tests have optimal or nearly optimal trade-offs between…
Two simple observations are made: (1) If the normal function associated to a Hodge class has a zero locus of positive dimension, then it has a singularity. (2) The intersection cohomology of the dual variety contains the cohomology of the…
This paper describes a class of sequences that are in many ways similar to Fibonacci sequences: given n, sum the previous two terms and divide them by the largest possible power of n. The behavior of such sequences depends on n. We analyze…
We study the existence of uncountable first-order structures that are homogeneous with respect to their finitely generated substructures. In many classical cases this is either well-known or follows from general facts, for example, if the…
Two factorizations of a permutation into products of cycles are equivalent if one can be obtained from the other by repeatedly interchanging adjacent disjoint factors. This paper studies the enumeration of equivalence classes under this…
We examine two associative products over the ring of symmetric functions related to the intransitive and Cartesian products of permutation groups. As an application, we give an enumeration of some Feynman type diagrams arising in Bender's…