Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2412.11726

A half-automated study of a 2-parameter family of integrals

David G. Zeitoun·Thierry Dana-Picard
View original source ↗Read source document ↗Export metadata ↓

Abstract

The study of some parametric integrals is presented with a combined approach of analytical development, the usage of a Computed Algebra System (CAS) and of the Online Encyclopedia of Integer Sequences. The methodology for the solution includes a) an analytical investigation for the study of the parametric integral, b) computations with a CAS of the integral for specific values of the parameter, c) investigation of the connection between the integral and special functions or classical numbers, and d) derivation of a general algorithm for the complete computation of the parametric integral. The central example of the paper is the parametric integral \begin{equation*} \label{the general integral} I_{n}^{(p)}=\int_0^{π/4} x^p \tan^n x\; dx, \end{equation*} The work reveals a connection of this parametric integral with Catalan numbers.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

David G. Zeitoun, Thierry Dana-Picard. 2024-12-16. A half-automated study of a 2-parameter family of integrals. https://arxiv.org/abs/2412.11726

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↗