English
Related papers

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

200 papers

Let X be a scroll over a rational surface. We construct a linear system of surfaces in P^3 yielding a birational map from P^3 to X. We apply this construction to the scrolls of Bordiga and Palatini.

Algebraic Geometry · Mathematics 2007-05-23 Emilia Mezzetti , Dario Portelli

In this paper we firstly review how to \textit{explicitly} solve a system of $3$ \textit{first-order linear recursions }and outline the main properties of these solutions. Next, via a change of variables, we identify a class of systems of…

Exactly Solvable and Integrable Systems · Physics 2024-09-10 Francesco Calogero

We define $\overline{\psi}$ to be the multiplicative arithemtic function that satisfies \[\overline{\psi}(p^{\alpha})=\begin{cases} p^{\alpha-1}(p+1), & \mbox{if } p\neq 2; \\ p^{\alpha-1}, & \mbox{if } p=2 \end{cases}\] for all primes $p$…

Number Theory · Mathematics 2015-01-08 Colin Defant

In a series of recent papers, W. M. Schmidt and L. Summerer developed a new theory by which they recover all major generic inequalities relating exponents of Diophantine approximation to a point in $\mathbb{R}^n$, and find new ones. Given a…

Number Theory · Mathematics 2016-07-05 Damien Roy

In this paper, we initiate the study of discrepancy questions for combinatorial designs. Specifically, we show that, for every fixed $r\ge 3$ and $n\equiv 1,3 \pmod{6}$, any $r$-colouring of the triples on $[n]$ admits a Steiner triple…

Combinatorics · Mathematics 2025-07-28 Lior Gishboliner , Stefan Glock , Amedeo Sgueglia

A famous theorem of Kirkman says that there exists a Steiner triple system of order $n$ if and only if $n\equiv 1,3\mod{6}$. In 1973, Erd\H{o}s conjectured that one can find so-called `sparse' Steiner triple systems. Roughly speaking, the…

Combinatorics · Mathematics 2020-03-02 Stefan Glock , Daniela Kühn , Allan Lo , Deryk Osthus

We first consider the Hamiltonian formulation of $n=3$ systems in general and show that all dynamical systems in ${\mathbb R}^3$ are bi-Hamiltonian. An algorithm is introduced to obtain Poisson structures of a given dynamical system. We…

Exactly Solvable and Integrable Systems · Physics 2015-05-13 Metin Gurses , Gusein Sh. Guseinov , Kostyantyn Zheltukhin

We construct a Ramsey class whose objects are Steiner systems. In contrast to the situation with general $r$-uniform hypergraphs, it turns out that simply putting linear orders on their sets of vertices is not enough for this purpose: one…

Combinatorics · Mathematics 2017-09-25 Vindya Bhat , Jaroslav Nešetřil , Christian Reiher , Vojtěch Rödl

Let $G$ be a graph and $f: G\rightarrow G$ be a continuous map. We establish a structure theorem which describes the structures of the set $R(f)-\overline{P(f)}$, where $R(f)$ and $P(f)$ are the recurrent point set and the periodic point…

Dynamical Systems · Mathematics 2023-10-31 Jiehua Mai , Enhui Shi , Kesong Yan , Fanping Zeng

We investigate a generalized poly-Laplacian system with a parameter on weighted finite graph, a generalized poly-Laplacian system with a parameter and Dirichlet boundary value on weighted locally finite graphs, and a $(p,q)$-Laplacian…

Analysis of PDEs · Mathematics 2024-01-30 Yan Pang , Junping Xie , Xingyong Zhang

We show that for any n divisible by 3, almost all order-n Steiner triple systems have a perfect matching (also known as a parallel class or resolution class). In fact, we prove a general upper bound on the number of perfect matchings in a…

Combinatorics · Mathematics 2020-07-29 Matthew Kwan

A design is said to be $f$-pyramidal when it has an automorphism group which fixes $f$ points and acts sharply transitively on all the others. The problem of establishing the set of values of $v$ for which there exists an $f$-pyramidal…

Combinatorics · Mathematics 2016-04-01 Marco Buratti , Gloria Rinaldi , Tommaso Traetta

In 2000, Rees and Shalaby constructed simple indecomposable two-fold cyclic triple systems for all v congruent to 0, 1, 3, 4, 7, and 9 (mod 12) where v = 4 or v>11, using Skolem-type sequences. We construct, using Skolem-type sequences,…

Combinatorics · Mathematics 2014-04-03 Nabil Shalaby , Bradley Sheppard , Daniela Silvesan

To each complex number $\lambda$ is associated a representation $\pi_\lambda$ of the conformal group $SO_0(1,n)$ on $\mathcal C^\infty(S^{n-1})$ (spherical principal series). For three values $\lambda_1,\lambda_2,\lambda_3$, we construct a…

Representation Theory · Mathematics 2010-01-19 Jean-Louis Clerc , Bent Orsted

We propose a combinatorial method of proving non-specialty of a linear system of curves with multiple points in general positions. As an application we obtain a classification of special linear systems on P1xP1 for which the multiplicities…

Algebraic Geometry · Mathematics 2008-11-04 Tomasz Lenarcik

We give estimates on the number of combinatorial designs, which prove (and generalise) a conjecture of Wilson from 1974 on the number of Steiner Triple Systems. This paper also serves as an expository treatment of our recently developed…

Combinatorics · Mathematics 2015-04-14 Peter Keevash

Let $n$, $k$, and $t$ be integers satisfying $n>k>t\ge2$. A Steiner system with parameters $t$, $k$, and $n$ is a $k$-uniform hypergraph on $n$ vertices in which every set of $t$ distinct vertices is contained in exactly one edge. An…

Combinatorics · Mathematics 2013-03-19 Asaf Ferber , Rani Hod , Michael Krivelevich , Benny Sudakov

We study the Hilbert series of a family of ideals J_\phi generated by powers of linear forms in k[x_1,...,x_n]. Using the results of Emsalem-Iarrobino, we formulate this as a question about fatpoints in P^{n-1}. In the three variable case…

Algebraic Geometry · Mathematics 2007-05-23 Hal Schenck

Let ${{\overline{p}}_{3}}(n)$ be the number of overpartition triples of $n$. By elementary series manipulations, we establish some congruences for ${\overline{p}}_{3}(n)$ modulo small powers of 2, such as…

Number Theory · Mathematics 2015-05-13 Liuquan Wang

The existence of Steiner triple systems STS(n) of order n containing no nontrivial subsystem is well known for every admissible n. We generalize this result in two ways. First we define the expander property of 3-uniform hypergraphs and…

Combinatorics · Mathematics 2020-03-10 Zoltán L. Blázsik , Zoltán Lóránt Nagy
‹ Prev 1 2 3 10 Next ›