English
Related papers

Related papers: Arithmetic-term representations for the greatest c…

200 papers

We study the non-linear extension of integer programming with greatest common divisor constraints of the form $\gcd(f,g) \sim d$, where $f$ and $g$ are linear polynomials, $d$ is a positive integer, and $\sim$ is a relation among $\leq, =,…

Logic in Computer Science · Computer Science 2023-08-29 Rémy Defossez , Christoph Haase , Alessio Mansutti , Guillermo A. Perez

Let $A$ and $B$ be sets of nonnegative integers. For a positive integer $n$ let $R_{A}(n)$ denote the number of representations of $n$ as the sum of two terms from $A$. Let $\displaystyle s_{A}(x) = \max_{n \le x}R_{A}(n)$ and…

Number Theory · Mathematics 2015-07-17 Sándor Z. Kiss , Csaba Sándor

This paper presents a regularization theory for numerical computation of polynomial greatest common divisors and a convergence analysis, along with a detailed description of a blackbox-type algorithm. The root of the ill-posedness in…

Numerical Analysis · Mathematics 2021-03-09 Zhonggang Zeng

The partitions of the integers can be expressed exactly in an iterative and closed-form expression. This equation is derived from distributing the partitions of a number in a network that locates each partition in a unique and orderly…

Number Theory · Mathematics 2021-10-11 Romulo L. Cruz-Simbron

In [8] a notion of generalized Hadamard product was introduced. We show that when certain kinds of tensors interact with the eigenvalues of symmetric matrices the resulting formulae can be nicely expressed using the generalized Hadamard…

Optimization and Control · Mathematics 2007-05-23 Hristo S. Sendov

Fibonacci numbers can be expressed in terms of multinomial coefficients as sums over integer partitions into odd parts. We use this fact to introduce a family of double inequalities involving the generating function for the number of…

Number Theory · Mathematics 2014-08-07 Cristina Ballantine , Mircea Merca

We represent a general bilinear Calder\'on-Zygmund operator as a sum of simple dyadic operators. The appearing dyadic operators also admit a simple proof of a sparse bound. In particular, the representation implies a so called sparse T1…

Classical Analysis and ODEs · Mathematics 2019-01-23 Kangwei Li , Henri Martikainen , Yumeng Ou , Emil Vuorinen

We compute the module of universal norms for a de Rham p-adic representation. The computation uses the theory of (phi,Gamma)-modules (Cherbonnier-Colmez's reciprocity formula) and the differential equation attached to a de Rham…

Number Theory · Mathematics 2010-02-22 Laurent Berger

In this paper, we introduce a new method for calculating fractional integrals and differentials. The method involves an equation that we have obtained from infinite applied integration by parts. The equation works for special class of…

General Mathematics · Mathematics 2023-09-08 Oleg Yaremko , Andrey Yachmenev

We generalize the well known Glaisher partition bijection result. For given positive integers n, d, both greater than 1, we provide a rich family of bijections between the set of partitions of n where at least one part is divisible by d,…

Combinatorics · Mathematics 2020-03-19 Aritro Pathak

We describe a generalization of the concept of a pc presentation that applies to groups with a nontrivial solvable radical. Such a representation can be much more efficient in terms of memory use and even of arithmetic, than permuattion and…

Group Theory · Mathematics 2025-09-25 Alexander Hulpke

In this paper, we consider the problem of representing any polynomial in terms of the ordered Bell and degenerate ordered Bell polynomials, and more generally of the higher-order ordered Bell and higher-order degenerate ordered Bell…

Number Theory · Mathematics 2021-10-08 Dae san Kim , Taekyun Kim

A new formula for the partition function $p(n)$ is developed. We show that the number of partitions of $n$ can be expressed as the sum of a simple function of the two largest parts of all partitions. Specifically, if $a_1 + >... + a_k = n$…

Combinatorics · Mathematics 2010-02-09 Jerome Kelleher

The author in [7] was proved the generalized remainder and quotient theorems of polynomial in one indeterminate where the divisor is complete factorization to linear factors. In this paper we give the formula for the generalized remainder…

Numerical Analysis · Mathematics 2015-06-23 Wiwat Wanicharpichat

A cubic partition is an integer partition wherein the even parts can appear in two colors. In this paper, we introduce the notion of generalized cubic partitions and prove a number of new congruences akin to the classical Ramanujan-type. We…

Number Theory · Mathematics 2025-05-19 Tewodros Amdeberhan , James A. Sellers , Ajit Singh

In this paper, we study $k$-term arithmetic progressions $N, N+d, ..., N+(k-1)d$ of powerful numbers. Under the $abc$-conjecture, we obtain $d \gg_\epsilon N^{1/2 - \epsilon}$. On the other hand, there exist infinitely many $3$-term…

Number Theory · Mathematics 2022-10-04 Tsz Ho Chan

For any finite group G with a finite G-set X and a modular tensor category C we construct a part of the algebraic structure of an associated G-equivariant monoidal category: For any group element g in G we exhibit the module category…

Quantum Algebra · Mathematics 2010-06-22 Till Barmeier

We consider the problem of representation of a bivariate function by sums of ridge functions. We show that if a function of a certain smoothness class is represented by a sum of finitely many, arbitrarily behaved ridge functions, then it…

Classical Analysis and ODEs · Mathematics 2016-06-28 Rashid Aliev , Vugar Ismailov

One-parameter generalizations of the logarithmic and exponential functions have been obtained as well as algebraic operators to retrieve extensivity. Analytical expressions for the successive applications of the sum or product operators on…

We propose an alternative way to represent graphs via OBDDs based on the observation that a partition of the graph nodes allows sharing among the employed OBDDs. In the second part of the paper we present a method to compute at the same…

Logic in Computer Science · Computer Science 2009-09-29 Carla Piazza , Alberto Policriti
‹ Prev 1 3 4 5 6 7 10 Next ›