English
Related papers

Related papers: Linear independence criteria for generalized polyl…

200 papers

The volume of a cyclic polytope can be obtained by forming an iterated integral along a suitable piecewise linear path running through its edges. Different choices of such a path are related by the action of a subgroup of the combinatorial…

Rings and Algebras · Mathematics 2025-06-03 Felix Lotter , Rosa Preiß

We introduce a class of iterated integrals, defined through a set of linearly independent integration kernels on elliptic curves. As a direct generalisation of multiple polylogarithms, we construct our set of integration kernels ensuring…

High Energy Physics - Theory · Physics 2018-06-13 Johannes Broedel , Claude Duhr , Falko Dulat , Lorenzo Tancredi

Assume $n\geq 2$. Consider the elementary symmetric polynomials $e_k(y_1,y_2,\ldots, y_n)$ and denote by $E_0,E_1,\ldots,E_{n-1}$ the elementary symmetric polynomials in reverse order \begin{align*}…

Classical Analysis and ODEs · Mathematics 2015-06-09 Waldemar Pompe , Patrizio Neff

Call a function f : F_2^n -> {0,1} odd-cycle-free if there are no x_1, ..., x_k in F_2^n with k an odd integer such that f(x_1) = ... = f(x_k) = 1 and x_1 + ... + x_k = 0. We show that one can distinguish odd-cycle-free functions from those…

Data Structures and Algorithms · Computer Science 2012-07-16 Arnab Bhattacharyya , Elena Grigorescu , Prasad Raghavendra , Asaf Shapira

Let $\mathbb{K}$ be an algebraically closed field, and $A \subset \mathbb{K}[x_{1}, \ldots, x_n]$ be a subalgebra of finite codimension. It is known that there exists a (not necessarily unique) finite filtration of $\mathbb{K}$-algebras \[…

Commutative Algebra · Mathematics 2026-03-26 Erik Leffler

Linear algebra's main concerns are sets of vectors, linear functions, subspaces, linear systems, matrices and concepts about those, such as whether the solution of linear system exists or is unique; a set of vectors is linearly independent…

Symbolic Computation · Computer Science 2025-04-15 Iago Leal de Freitas , Júlia Mota , João Paixão , Lucas Rufino

Let $G$ be an acylic directed graph. For each vertex $g \in G$, we define an involution on the independent sets of $G$. We call these involutions flips, and use them to define a new partial order on independent sets of $G$. Trim lattices…

Combinatorics · Mathematics 2019-04-01 Hugh Thomas , Nathan Williams

We consider a continuous version of the classical notion of Banach limits, namely, positive linear functionals on $L^{\infty}(\mathbb{R}_+)$ invariant under translations $f(x) \mapsto f(x+s)$ of $L^{\infty}(\mathbb{R}_+)$ for every $s \ge…

Functional Analysis · Mathematics 2017-10-27 Ryoichi Kunisada

Probabilistic independence is a useful concept for describing the result of random sampling---a basic operation in all probabilistic languages---and for reasoning about groups of random variables. Nevertheless, existing verification methods…

Programming Languages · Computer Science 2020-07-21 Gilles Barthe , Justin Hsu , Kevin Liao

We prove a highly uniform version of the prime number theorem for a certain class of $L$-functions. The range of $x$ depends polynomially on the analytic conductor, and the error term is expressed in terms of an optimization problem…

Number Theory · Mathematics 2025-03-18 Ikuya Kaneko , Jesse Thorner

A milestone in Probability Theory is the law of the iterated logarithm (LIL), proved by Khinchin and independently by Kolmogorov in the 1920s, which asserts that for iid random variables $\{t_i\}_{i=1}^{\infty}$ with mean $0$ and variance…

Combinatorics · Mathematics 2017-10-12 Asaf Ferber , Daniel Montealegre , Van Vu

We prove quite general statements about functional equations in any number of variables for the dilogarithms defined by Bloch-Wigner, Rogers, and Coleman, showing that they follow from certain 5-term and 2-term relations in a precise way.…

Number Theory · Mathematics 2020-07-23 Rob de Jeu

We introduce a generalization $G^{(\alpha)}(X)$ of the truncated logarithm $\mathcal{L}_1(X) = \sum_{k=1}^{p-1}X^k/k$ in characteristic $p$, which depends on a parameter $\alpha$. The main motivation of this study is $G^{(\alpha)}(X)$ being…

Number Theory · Mathematics 2023-02-21 Marina Avitabile , Sandro Mattarei

In this paper, we established a sharp version of the difference analogue of the celebrated H\"{o}lder's theorem concerning the differential independence of the Euler gamma function $\Gamma$. More precisely, if $P$ is a polynomial of $n+1$…

Number Theory · Mathematics 2023-03-07 Qiongyan Wang , Xiao Yao

In this article, logarithmically complete monotonicity properties of some functions such as $\frac1{[\Gamma(x+1)]^{1/x}}$, $\frac{[{\Gamma(x+\alpha+1)}]^{1/(x+\alpha)}}{[{\Gamma(x+1)}]^{1/x}}$, $\frac{[\Gamma(x+1)]^{1/x}}{(x+1)^\alpha}$ and…

Classical Analysis and ODEs · Mathematics 2010-08-03 Feng Qi , Bai-Ni Guo

Central limit theorems are established for the sum, over a spatial region, of observations from a linear process on a $d$-dimensional lattice. This region need not be rectangular, but can be irregularly-shaped. Separate results are…

Statistics Theory · Mathematics 2016-01-07 S. N. Lahiri , Peter M. Robinson

We prove the irrationality of the classical Dirichlet L-value $L(2,\chi_{-3})$. The argument applies a new kind of arithmetic holonomy bound to a well-known construction of Zagier. In fact our work also establishes the $\mathbf{Q}$-linear…

Number Theory · Mathematics 2024-09-18 Frank Calegari , Vesselin Dimitrov , Yunqing Tang

We formulate a parametrized uniformly absolutely globally convergent series of $\zeta$(s) denoted by Z(s, x). When expressed in closed form, it is given by Z(s, x) = (s -- 1)$\zeta$(s) + 1 x Li s z z -- 1 dz, where Li s (x) is the…

Number Theory · Mathematics 2016-08-25 Lazhar Fekih-Ahmed

In this paper, we estimate the linear independence measures for the values of a class Mahler functions of degree one and two. For the purpose, we study the determinants of suitable Hermite-Pad\'{e} approximation polynomials. Based on the…

Number Theory · Mathematics 2016-04-07 Keijo Väänänen , Wen Wu

We study the computational power of polynomial threshold functions, that is, threshold functions of real polynomials over the boolean cube. We provide two new results bounding the computational power of this model. Our first result shows…

Computational Complexity · Computer Science 2009-11-29 Ido Ben-Eliezer , Shachar Lovett , Ariel Yadin
‹ Prev 1 3 4 5 6 7 10 Next ›