English
Related papers

Related papers: An improved Recursive Construction for Disjoint St…

200 papers

The derived category of a general complete intersection of four quadrics in P^{2n-1} has a semi-orthogonal decomposition < O(-2n+9), ..., O(-1), O, D >, where D is the derived category of twisted sheaves on a certain non-algebraic complex…

Algebraic Geometry · Mathematics 2009-11-11 Nicolas Addington

Additive spanners are fundamental graph structures with wide applications in network design, graph sparsification, and distance approximation. In particular, a $4$-additive spanner is a subgraph that preserves all pairwise distances up to…

Data Structures and Algorithms · Computer Science 2025-10-21 Chuhan Qi

A set of positive integers with the property that the product of any two of them is the successor of a perfect square is called Diophantine $D(-1)$--set. Such objects are usually studied via a system of generalized Pell equations naturally…

Number Theory · Mathematics 2022-01-26 Nicolae Ciprian Bonciocat , Mihai Cipu , Maurice Mignotte

We obtain solutions to the recursive sequences of the form $$x_{n + 1} = \frac{x_{n - 3}x_{n }}{x_{n - 2}(a_n + b_nx_{n -3}x_{n})}$$ where $a_n$ and $b_n$ are arbitrary sequences of real numbers, and the initial values are gives as;…

Dynamical Systems · Mathematics 2019-02-19 Mensah Folly-Gbetoula , Darlison Nyirenda

The unknown inputs in a dynamical system may represent unknown external drivers, input uncertainty, state uncertainty, or instrument faults and thus unknown-input reconstruction has several wide-spread applications. In this paper we…

Optimization and Control · Mathematics 2015-09-22 Roshan A Chavan , Harish J. Palanthandalam-Madapusi

We study the structure of the algebra of polynomial invariants for the usual conjugation action of the complex special, SO_n, and general, O_n, orthogonal group on the space of traceless n by n complex matrices. (Note that these two…

Commutative Algebra · Mathematics 2009-09-01 Dragomir Z. Djokovic

We prove that with high probability $\mathbb{G}^{(3)}(n,n^{-1+o(1)})$ contains a spanning Steiner triple system for $n\equiv 1,3\pmod{6}$, establishing the exponent for the threshold probability for existence of a Steiner triple system. We…

Combinatorics · Mathematics 2022-05-04 Ashwin Sah , Mehtaab Sawhney , Michael Simkin

Phylogenetic reconciliation seeks to explain host-symbiont co-evolution by mapping parasite trees onto host trees through events such as cospeciation, duplication, host switching, and loss. Finding an optimal reconciliation that ensures…

Populations and Evolution · Quantitative Biology 2026-02-02 Cyriac Antony , Alessio Martino , Blerina Sinaimeri

In 1998, E. Couselo, S. Gonz\'alez, V. T. Markov, and A. A. Nechaev introduced the notions of recursive codes and recursively differentiable quasigroups. They conjectured that recursive MDS codes of dimension $2$ and length $4$ exist over…

Information Theory · Computer Science 2026-04-02 Petr Klimov

For Tur\'an's (3, 4)-conjecture, in the case of n = 3k+1 vertices, (.5)6^{k-1} non-isomorphic complexes are constructed that attain the conjecture. In the case of n = 3k+2 vertices, 6^{k-1} non-isomorphic complexes are constructed that…

Combinatorics · Mathematics 2008-06-27 Andrew Frohmader

We construct renormalised models of regularity structures by using a recursive formulation for the structure group and for the renormalisation group. This construction covers all the examples of singular SPDEs which have been treated so far…

Probability · Mathematics 2023-10-24 Yvain Bruned

Algebraic structures of N = (4; 4) and N = (8; 8) supersymmetric (SUSY) two dimensional sigma models on Lie groups (in general) and SUSY Wess-Zumino-Witten (WZW) models (as special) are obtained. For SUSY WZW models, these algebraic…

High Energy Physics - Theory · Physics 2014-10-08 M. Aali-Javanangrouh , A. Rezaei-Aghdam

There is the same number of $n \times n$ alternating sign matrices (ASMs) as there is of descending plane partitions (DPPs) with parts no greater than $n$, but finding an explicit bijection is an open problem for about $40$ years now. So…

Combinatorics · Mathematics 2022-12-05 Florian Aigner , Ilse Fischer

We introduce the theory of div point sets, which aims to provide a framework to study the combinatoric nature of any set of points in general position on an Euclidean plane. We then show that proving the unsatisfiability of some first-order…

Combinatorics · Mathematics 2019-09-02 Archy Will He

The notions of special and extraspecial pairs of roots were introduced by Carter for calculating structure constants, [Ca72]. Let $\{r, s\}$ be a special pair of roots for which the structure constant $N(r,s)$ is sought, and let $\{r_1,…

Representation Theory · Mathematics 2025-10-21 Rafael Stekolshchik

We investigate the structure and reconstruction complexity of Manacher arrays. First, we establish a combinatorial lower bound, proving that the number of rooted tandem repeat trees with $n+1$ genes exceeds the number of distinct Manacher…

Data Structures and Algorithms · Computer Science 2025-07-21 Michael Itzhaki

Let $D$ be a strong digraph on $n\geq 4$ vertices. In [3, Discrete Applied Math., 95 (1999) 77-87)], J. Bang-Jensen, Y. Guo and A. Yeo proved the following theorem: if (*) $d(x)+d(y)\geq 2n-1$ and $min \{d^+(x)+ d^-(y),d^-(x)+ d^+(y)\}\geq…

Combinatorics · Mathematics 2012-09-21 S. Kh. Darbinyan , I. A. Karapetyan

The CHY construction naturally associates a vector in $\mathbb{R}^{(n-3)!}$ to every 2-regular graph with $n$ vertices. Partial amplitudes in the biadjoint scalar theory are given by the inner product of vectors associated with a pair of…

Mathematical Physics · Physics 2020-01-29 Freddy Cachazo , Karen Yeats , Samuel Yusim

Adjacent dyadic systems are pivotal in analysis and related fields to study continuous objects via collections of dyadic ones. In our prior work (joint with Jiang, Olson and Wei) we describe precise necessary and sufficient conditions for…

Classical Analysis and ODEs · Mathematics 2020-05-01 Theresa C. Anderson , Bingyang Hu

We give bijective results between several variants of lattice paths of length $2n$ (or $2n-2$) and integer compositions of n, all enumerated by the seemingly innocuous formula $4^{n-1}$. These associations lead us to make new connections…

Combinatorics · Mathematics 2024-06-25 Manosij Ghosh Dastidar , Michael Wallner