Related papers: An Elementary Linear-Algebraic Proof without Compu…
This article has been written for an educational magazine whose target audience consists of students and teachers of mathematics in universities, colleges and schools. It concerns a notion of duality between rectangles. A proof is given…
For $E/K$ an elliptic curve without complex multiplication we bound the index of the image of $\operatorname{Gal}(\bar{K}/K)$ in $\operatorname{GL}_2(\hat{\mathbb{Z}})$, the representation being given by the action on the Tate modules of…
Proving proof-size lower bounds for $\mathbf{LK}$, the sequent calculus for classical propositional logic, remains a major open problem in proof complexity. We shed new light on this challenge by isolating the power of structural rules,…
Linear logic has provided new perspectives on proof-theory, denotational semantics and the study of programming languages. One of its main successes are proof-nets, canonical representations of proofs that lie at the intersection between…
In this paper we explore the design of sequent calculi operating on graphs. For this purpose, we introduce a set of logical connectives allowing us to extend the correspondence between cographs and classical propositional formulas to any…
A theorem of Serre states that almost all plane conics over $\mathbb{Q}$ have no rational point. We prove an analogue of this for families of conics parametrised by elliptic curves using elliptic divisibility sequences and a version of the…
Several problems which could be thought of as belonging to recreational mathematics are described. They are all such that solutions to the problem depend on finding rational points on elliptic curves. Many of the problems considered lead to…
We characterize in terms of the Goldman Lie algebra which conjugacy classes in the fundamental group of a surface with non empty boundary are represented by simple closed curves. We prove the following: A non power conjugacy class X…
A complex elliptic curve $E$ can be defined as the quotient of the analytic space $\mathbb{C}^*$ by a discrete action of the cyclic group $q^{\mathbb{Z}}$ for $\vert q\vert \neq 1$. We study the boundary case when $\vert q\vert =1$, which…
We present a new approach to the proof of ergodic theorems for actions of free groups based on geometric covering and asymptotic invariance arguments. Our approach can be viewed as a direct generalization of the classical geometric covering…
In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theory of unit-free multiplicative proof nets. A linking is no longer a set…
We study the notion of linear sofic approximations for algebras, analogous to the concept of sofic representations for groups. We prove that for a finitely generated amenable $K$-algebra with no zero divisors, all linear sofic…
We consider the expansion of the real field by the group of rational points of an elliptic curve over the rational numbers. We prove a completeness result, followed by a quantifier elimination result. Moreover we show that open sets…
Automated Theorem Proving (ATP) is an established branch of Artificial Intelligence. The purpose of ATP is to design a system which can automatically figure out an algorithm either to prove or disprove a mathematical claim, on the basis of…
In this paper, we develop a new and efficient approach to the computation of envelope surfaces. We interpret one-parameter systems of surfaces as curves in the homogeneous spaces of suitable Lie groups. Using the formalism of Lie groups and…
We prove that a very general elliptic surface $\mathcal{E}\to\mathbb{P}^1$ over the complex numbers with a section and with geometric genus $p_g\ge2$ contains no rational curves other than the section and components of singular fibers.…
Axiomatizing mathematical structures is a goal of Mathematical Logic. Axiomatizability of the theories of some structures have turned out to be quite difficult and challenging, and some remain open. However axiomatization of some…
We study the low-lying zeros of various interesting families of elliptic curve L-functions. One application is an upper bound on the average analytic rank of the family of all elliptic curves. The upper bound obtained is less than two,…
The syntactic nature of logic and computation separates them from other fields of mathematics. Nevertheless, syntax has been the only way to adequately capture the dynamics of proofs and programs such as cut-elimination, and the finiteness…
It is well-known that the linear secret-sharing scheme (LSSS) can be constructed from linear error-correcting codes (Brickell [1], R.J. McEliece and D.V.Sarwate [2],Cramer, el.,[3]). The theory of linear codes from algebraic-geometric…