Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · math/0211201

Simplicial complexes associated to certain subsets of natural numbers and its applications to multiplicative functions

Jan Snellman
View original source ↗Read source document ↗Export metadata ↓

Abstract

We call a set of positive integers closed under taking unitary divisors a unitary ideal. It can be regarded as a simplicial complex. Moreover, a multiplicative arithmetical function on such a set corresponds to a function on the simplicial complex with the property that the value on a face is the product of the values at the vertices of that face. We use this observation to solve the following problems: 1) Let r be a positive integer and c a real number. What is the maximum value that \sum_{s \in S}g(s) can obtain when S is a unitary ideal containing precisely r prime powers, and g is the multiplicative function determined by g(s)=c when s \in S is a prime power? 2) Suppose that g is a multiplicative function which is \ge 1, and that we want to find the maximum of g(i) when 1 \le i \le n. At how many integers do we need to evaluate g?

Explore related subjects

math.COmath.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jan Snellman. 2002-11-13. Simplicial complexes associated to certain subsets of natural numbers and its applications to multiplicative functions. https://arxiv.org/abs/math/0211201

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗