English
Related papers

Related papers: On a question of Schmidt and Summerer concerning $…

200 papers

An $(n_3)$ configuration is an incidence structure equivalent to a linear hypergraph on $n$ vertices which is both 3-regular and 3-uniform. We investigate a variant in which one constraint, say 3-regularity, is present, and we allow exactly…

Combinatorics · Mathematics 2018-04-26 Peter Dukes , Kaoruko Iwasaki

Let $S$ be the numerical semigroup generated by three consecutive numbers $a,a+1,a+2$, where $a\in\mathbb{N}$, $a\geq 3$. We describe the elements of $S$ whose factorizations have all the same length, as well as the set of factorizations of…

Combinatorics · Mathematics 2024-04-10 Pedro A. García-Sánchez , Laura González , Francesc Planas-Vilanova

We introduce the Schubert form a $3$-bridge link diagram, as a generalization of the Schubert normal form of a $3$-bridge link. It consists of a set of six positive integers, written as $\left( p/n,q/m,s/l\right) $, with some conditions and…

Algebraic Topology · Mathematics 2017-03-02 Margarita Toro , Mauricio Rivera

One interpretation of Torelli's Theorem, which asserts that a compact Riemann Surface $X$ of genus $g > 1$ is determined by the $g(g+1)/2$ entries of the period matrix, is that the period matrix is a message about $X$. Since this message…

Algebraic Geometry · Mathematics 2013-09-11 James S. Wolper

A generalization of the classical Lipschitz summation formula is proposed. It involves new polylogarithmic rational functions constructed via the Fourier expansion of certain sequences of Bernoulli--type polynomials. Related families of…

Number Theory · Mathematics 2007-12-16 Stefano Marmi , Piergiulio Tempesta

We improve a bound due to the second author on number of rational points on smooth surfaces in $\mathbb{P}^3$ over finite fields and look at families of surfaces that achieve or nearly achieve this bound, for which we compute their exact…

Number Theory · Mathematics 2026-05-12 Yves Aubry , José Felipe Voloch

We show that for any n divisible by 3, almost all order-n Steiner triple systems admit a decomposition of almost all their triples into disjoint perfect matchings (that is, almost all Steiner triple systems are almost resolvable).

Combinatorics · Mathematics 2020-11-04 Asaf Ferber , Matthew Kwan

According to Karl Popper assumptions are statements used to construct theories. During the construction of a theory whether the assumptions are either true or false turn out to be irrelevant in view of the fact that, actually, they gain…

Classical Physics · Physics 2014-12-09 Israel Perez

By considering Eulerian numbers and ordered Stirling numbers of the second and third kinds over a multiset, we generalize identities of Eulerian numbers and Stirling numbers of the second and third kinds and provide $q$-analogs of these…

Combinatorics · Mathematics 2012-09-07 Joon Yop Lee

Define $||n||$ to be the complexity of $n$, the smallest number of ones needed to write $n$ using an arbitrary combination of addition and multiplication. The set $\mathscr{D}$ of defects, differences $\delta(n):=||n||-3\log_3 n$, is known…

Number Theory · Mathematics 2025-10-20 Harry Altman , Juan Arias de Reyna

This paper is part of a project that is based on the notion of dialectical system, introduced by Magari as a way of capturing trial and error mathematics. In previous work, we investigated the expressive and computational power of…

Logic · Mathematics 2018-10-17 Jacopo Amidei , Uri Andrews , Duccio Pianigiani , Luca San Mauro , Andrea Sorbi

We present a type system that combines, in a controlled way, first-order polymorphism with intersectiontypes, union types, and subtyping, and prove its safety. We then define a type reconstruction algorithm that issound and terminating.…

Programming Languages · Computer Science 2023-11-20 Giuseppe Castagna , Mickaël Laurent , Kim Nguyen

We prove configuration theorems that generalize the Desargues, Pascal, and Pappus theorems. Our generalization of the Desargues theorem allows us to introduce the structure of an Abelian group on the (properly extended) set of triangles…

Algebraic Geometry · Mathematics 2007-05-23 F. Bakharev , K. Kokhas , F. Petrov

A poset is (3+1)-free if it does not contain the disjoint union of chains of length 3 and 1 as an induced subposet. These posets play a central role in the (3+1)-free conjecture of Stanley and Stembridge. Lewis and Zhang have enumerated…

Combinatorics · Mathematics 2015-12-31 Mathieu Guay-Paquet , Alejandro H. Morales , Eric Rowland

We restate Thomassen's theorem of 3-extendability, an extension of the famous planar 5-choosability theorem, in terms of graph polynomials. This yields an Alon--Tarsi equivalent of 3-extendability.

Combinatorics · Mathematics 2023-11-23 Przemysław Gordinowicz , Paweł Twardowski

We introduce the notion of a rational dynamical system extending the classical notion of a topological dynamical system and we prove (multiple) recurrence results for such systems via a partition theorem for the rational numbers proved by…

General Topology · Mathematics 2011-01-18 Andreas Koutsogiannis

Improving a result of K\'arolyi, Pach and T\'oth, we construct an arrangement of $n$ segments in the plane with at most $n^{\log{8} / \log{169}}$ pairwise crossing or pairwise disjoint segments. We use the recursive method based on…

Combinatorics · Mathematics 2012-01-27 Jan Kynčl

We present three groups of examples of Wigner Quantum Systems related to the Lie superalgebras $osp(1/6n)$, $sl(1/3n)$ and $sl(n/3)$ and discuss shortly their physical features. In the case of $sl(1/3n)$ we indicate that the underlying…

High Energy Physics - Theory · Physics 2009-11-07 T. D. Palev , N. I. Stoilova

In a recent paper (2024) M. Buratti and M.E:Muzychuck have established some lower bounds on the number of non isomorphic cyclic Steiner Triple Systems of order $v\equiv 1$ (mod $6$). We complete their result to the case $v\equiv 3$ (mod…

Combinatorics · Mathematics 2025-09-30 Lotrenzo Mella , Gloria Rinaldi

The $3$-admissibility of a graph is a promising measure to identify real-world networks that have an algorithmically favourable structure. We design an algorithm that decides whether the $3$-admissibility of an input graph~$G$ is at…

Data Structures and Algorithms · Computer Science 2025-12-02 Christine Awofeso , Patrick Greaves , Oded Lachish , Felix Reidl