English
Related papers

Related papers: Divisibility problems for function fields

200 papers

Ideas from Fourier analysis have been used in cryptography for the last three decades. Akavia, Goldwasser and Safra unified some of these ideas to give a complete algorithm that finds significant Fourier coefficients of functions on any…

Cryptography and Security · Computer Science 2018-12-14 Steven D. Galbraith , Joel Laity , Barak Shani

Given a fixed finite metric space $(V,\mu)$, the {\em minimum $0$-extension problem}, denoted as ${\tt 0\mbox{-}Ext}[\mu]$, is equivalent to the following optimization problem: minimize function of the form $\min\limits_{x\in V^n} \sum_i…

Computational Complexity · Computer Science 2024-01-22 Martin Dvorak , Vladimir Kolmogorov

Pioneered by Benczur and Karger for cuts in graphs [STOC'96], sparsification is a fundamental topic with wide-ranging applications that has been studied, e.g., for graphs and hypergraphs, in a combinatorial and a spectral setting, and with…

Data Structures and Algorithms · Computer Science 2023-02-08 Jannik Kudla , Stanislav Živný

In this paper we have mainly focused on the uniqueness of two meromorphic functions under the realm of two shared sets problem with certain restrictions which in turn improve the results of { P. Sahoo and H. Karmakar, Uniqueness theorems…

Complex Variables · Mathematics 2020-09-01 Abhijit Banerjee , Saikat Bhattacharyya

We consider approximation problems for a special space of d variate functions. We show that the problems have small number of active variables, as it has been postulated in the past using concentration of measure arguments. We also show…

Numerical Analysis · Mathematics 2012-01-25 Markus Hegland , Greg W. Wasilkowski

We introduce the theory of div point sets, which aims to provide a framework to study the combinatoric nature of any set of points in general position on an Euclidean plane. We then show that proving the unsatisfiability of some first-order…

Combinatorics · Mathematics 2019-09-02 Archy Will He

In this paper an iterated function system on the space of distribution functions is built. The inverse problem is introduced and studied by convex optimization problems. Some applications of this method to approximation of distribution…

Statistics Theory · Mathematics 2007-06-13 Stefano M. Iacus , Davide La Torre

A finite set of integers $A$ tiles the integers by translations if $\mathbb{Z}$ can be covered by pairwise disjoint translated copies of $A$. Restricting attention to one tiling period, we have $A\oplus B=\mathbb{Z}_M$ for some…

Combinatorics · Mathematics 2022-03-09 Izabella Laba , Itay Londner

In this work we generalize the concept of injective module and develop a theory of divisibility for modules over a general ring, which provides a general and unified framework to study Kummer-like field extensions arising from commutative…

Commutative Algebra · Mathematics 2023-01-10 Sebastiano Tronto

Inspired by the work of Bourgain and Garaev (2013), we provide new bounds for certain weighted bilinear Kloosterman sums in polynomial rings over a finite field. As an application, we build upon and extend some results of Sawin and…

Number Theory · Mathematics 2026-01-28 Christian Bagshaw

For any $k\geq 1$, this paper studies the number of polynomials having $k$ irreducible factors (counted with or without multiplicities) in $\mathbf{F}_q[t]$ among different arithmetic progressions. We obtain asymptotic formulas for the…

Number Theory · Mathematics 2021-09-23 Lucile Devin , Xianchang Meng

In this survey we provide an overview of some recent developments in the construction of moduli spaces using stack-theoretic techniques. We will also explain the analogue of Harder-Narasimhan stratifications for general stacks, known as…

Algebraic Geometry · Mathematics 2023-09-22 Tomás L. Gómez , Andres Fernández Herrero , Alfonso Zamora

A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happens for instance when the constraint matrix is totally…

Data Structures and Algorithms · Computer Science 2009-09-29 Christoph Durr , Mathilde Hurand

We derive asymptotic estimates for distribution functions related to the Schinzel-Szekeres function. These results are then used in three different applications: the longest simple path in the divisor graph, a problem of Erd\H{o}s about a…

Number Theory · Mathematics 2025-06-16 Andreas Weingartner

We prove an inversion formula for summatory arithmetic functions. As an application, we obtain an arithmetic relationship between summatory Piltz divisor functions and a sum of the M\"obius function over certain integers, denoted by…

Number Theory · Mathematics 2013-10-11 Sergei Preobrazhenskii

We analyze the preservation properties of a family of reversible splitting methods when they are applied to the numerical time integration of linear differential equations defined in the unitary group. The schemes involve complex…

Numerical Analysis · Mathematics 2023-06-01 Joackim Bernier , Sergio Blanes , Fernando Casas , Alejandro Escorihuela-Tomàs

This is a note in which we first review symmetries of moduli spaces of stable meromorphic connections on trivial vector bundles over the Riemann sphere, and next discuss symmetries of their integrable deformations as an application. In the…

Classical Analysis and ODEs · Mathematics 2018-03-16 Kazuki Hiroe

This paper is concerned with the problem of sampling and interpolation involving derivatives in shift-invariant spaces and the error analysis of the derivative sampling expansions for fundamentally large classes of functions. A new type of…

Functional Analysis · Mathematics 2024-02-15 Kumari Priyanka , A. Antony Selvan

Partition of unities appear in many places in analysis. Typically they are generated by compactly supported functions with a certain regularity. In this paper we consider partition of unities obtained as integer-translates of entire…

Functional Analysis · Mathematics 2013-08-27 Ole Christensen , Hong Oh Kim , Rae Young Kim

The set splittability problem is the following: given a finite collection of finite sets, does there exits a single set that contains exactly half the elements from each set in the collection? (If a set has odd size, we allow the floor or…

Combinatorics · Mathematics 2019-09-17 Peter Bernstein , Cashous Bortner , Samuel Coskey , Shuni Li , Connor Simpson