Related papers: Some arithmetical problems that are obtained by an…
The two squares theorem of Fermat is a gem in number theory, with a spectacular one-sentence "proof from the Book". Here is a formalisation of this proof, with an interpretation using windmill patterns. The theory behind involves…
Polynomial factorization in conventional sense is an ill-posed problem due to its discontinuity with respect to coefficient perturbations, making it a challenge for numerical computation using empirical data. As a regularization, this paper…
Many problems can be presented in an abstract form through a wide range of binary objects and relations which are defined over problem domain. In these problems, graphical demonstration of defined binary objects and solutions is the most…
A fundamental question in graph theory is to establish conditions that ensure a graph contains certain spanning subgraphs. Two well-known examples are Tutte's theorem on perfect matchings and Dirac's theorem on Hamilton cycles.…
We study the problem of generating graphs with prescribed degree sequences for bipartite, directed, and undirected networks. We first propose a sequential method for bipartite graph generation and establish a necessary and sufficient…
Let C : y^2=f(x) be a hyperelliptic curve defined over the rationals. Let K be a number field and suppose f factors over K as a product of irreducible polynomials f=f_1 f_2...f_r. We shall define a "Selmer set" corresponding to this…
We discuss the best methods available for computing the gamma function $\Gamma(z)$ in arbitrary-precision arithmetic with rigorous error bounds. We address different cases: rational, algebraic, real or complex arguments; large or small…
In analytic number theory, several results make use of information regarding the prime values of a multiplicative function in order to extract information about its averages. Examples of such results include Wirsing's theorem and the…
It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…
A method to the explict solutions of general systems of algebraic equations is presented via the metric form of affiliated K\"ahler manifolds. The solutions to these systems arise from sets of geodesic second order non-linear differential…
We consider the problem of estimating undirected triangle-free graphs of high dimensional distributions. Triangle-free graphs form a rich graph family which allows arbitrary loopy structures but 3-cliques. For inferential tractability, we…
In this paper extremal problems for uniform hypergraphs are studied in the general setting of hereditary properties. It turns out that extremal problems about edges are particular cases of a general analyic problem about a recently…
Although symmetry methods and analysis are a necessary ingredient in every physicist's toolkit, rather less use has been made of combinatorial methods. One exception is in the realm of Statistical Physics, where the calculation of the…
A method is introduced for studying large deviations in the context of statistical physics of disordered systems. The approach, based on an extension of the cavity method to atypical realizations of the quenched disorder, allows us to…
We study the algorithmic complexity of fair division problems with a focus on minimizing the number of queries needed to find an approximate solution with desired accuracy. We show for several classes of fair division problems that under…
First we prove some elementary but useful identities in the group ring of Q/Z. Our identities have potential applications to several unsolved problems which involve sums of Farey fractions. In this paper we use these identities, together…
So far, it is not well known how to deal with dissipative systems. There are many paths of investigation in the literature and none of them present a systematic and general procedure to tackle the problem. On the other hand, it is well…
Learning properties of large graphs from samples has been an important problem in statistical network analysis since the early work of Goodman \cite{Goodman1949} and Frank \cite{Frank1978}. We revisit a problem formulated by Frank…
Knowing when a graphical model is perfect to a distribution is essential in order to relate separation in the graph to conditional independence in the distribution, and this is particularly important when performing inference from data.…
In recent years, we have seen several approaches to the graph isomorphism problem based on "generic" mathematical programming or algebraic (Gr\"obner basis) techniques. For most of these, lower bounds have been established. In fact, it has…