相关论文: The Laurent phenomenon

We generalize Carlitz' result on the number of self reciprocal monic irreducible polynomials over finite fields by showing that similar explicit formula hold for the number of irreducible polynomials obtained by a fixed quadratic…

We prove a general duality theorem for tangle-like dense objects in combinatorial structures such as graphs and matroids. This paper continues, and assumes familiarity with, the theory developed in [6]

In a recent paper, Bilu et al. studied a conjecture of Marques and Lengyel on the $p$-adic valuation of the Tribonacci sequence. In this article, we study the $p$-adic valuation of third order linear recurrence sequences by considering a…

We prove a stronger version of Jarden's Theorem for recurrence of powers of recursive functions

For an integer $k\geq 2$, let $(L_{n}^{(k)})_{n}$ be the $k-$generalized Lucas sequence which starts with $0,\ldots,0,2,1$ ($k$ terms) and each term afterwards is the sum of the $k$ preceding terms. In this paper, we find all the integers…

In this paper we combine methods from additive combinatorics and Diophantine geometry to study the generalised sum-product phenomenon in algebraic groups. As an application of this circle of ideas, we resolve a conjecture of Bremner on…

We generalize a semi-norm for the Alexander polynomial of a connected, compact, oriented 3-manifold on its first cohomology group to a semi-norm for an arbitrary Laurent polynomial f on the dual vector space to the space of exponents of f.…

We undertake a general study of multifractal phenomena for functions. We show that the existence of several kinds of multifractal functions can be easily deduced from an abstract statement, leading to new results. This general approach does…

In this paper we show examples for applications of the Bombieri-Lang conjecture in additive combinatorics, giving bounds on the cardinality of sumsets of squares and higher powers of integers. Using similar methods we give bounds on the…

We generalize a version of Lavrent\'ev's theorem which says that a function that is continuous on a compact set K with connected complement and without interior points can be uniformly approximated as closely as desired by a polynomial…

One relates factorization of bivariate polynomials to singularities of projective plane curves. One proves that adjoint polynomials permit to solve the recombinations of the modular factors induced by the absolute and rational…

A well-known conjecture of Orlov asks whether the existence of a full exceptional collection implies rationality of the underlying variety. We prove this conjecture for arithmetic toric varieties over general fields. We also investigate a…

We show that recent determinant evaluations involving Catalan numbers and generalisations thereof have most convenient explanations by combining the Lindstr\"om-Gessel-Viennot theorem on non-intersecting lattice paths with a simple…

It was observed by Bump et al. that Ehrhart polynomials in a special family exhibit properties similar to the Riemann {\zeta} function. The construction was generalized by Matsui et al. to a larger family of reflexive polytopes coming from…

The combinatorial structure of a d-dimensional simple convex polytope can be reconstructed from its abstract graph [Blind & Mani 1987, Kalai 1988]. However, no polynomial/efficient algorithm is known for this task, although a polynomially…

In a recent paper, Gonek, Graham, and Lee introduced a notion of the Lindel\"of hypothesis (LH) for general sequences which coincides with the usual Lindel\"of hypothesis for the Riemann zeta function in the case of the sequence of positive…

The K{\L}R conjecture of Kohayakawa, {\L}uczak, and R\"odl is a statement that allows one to prove that asymptotically almost surely all subgraphs of the random graph G_{n,p}, for sufficiently large p : = p(n), satisfy an embedding lemma…

Contrary to what is often stated, a fundamental spacetime discreteness need not contradict Lorentz invariance. A causal set's discreteness is in fact locally Lorentz invariant, and we recall the reasons why. For illustration, we introduce a…

We prove that the ordered configuration spaces of planar graphs have the highest possible topological complexity generically, as predicted by a conjecture of Farber. Our argument establishes the same generic maximality for all higher…

We associate to any convenient nondegenerate Laurent polynomial on the complex torus (C^*)^n a canonical Frobenius-Saito structure on the base space of its universal unfolding. According to the method of K. Saito (primitive forms) and of M.…