English
Related papers

Related papers: A generalization of the cylinder conjecture for di…

200 papers

Generic polyhedra are interesting mathematical objects to study in their own right. In this paper, we initialize a systematic study of two-dimensional generic polyhedra with an eye towards applications to low-dimensional topology,…

Geometric Topology · Mathematics 2026-01-09 Lucas Fagan , Yang Qiu , Zhenghan Wang

We show that the Generalized Vanishing Conjecture $$\forall_{m \ge 1} [\Lam^m f^m = 0] \Longrightarrow \forall_{m \gg 0} [\Lam^m (g f^m) = 0]$$ for a fixed differential operator $\Lam \in k[\partial]$ follows from a special case of it,…

Commutative Algebra · Mathematics 2013-10-24 Michiel de Bondt

In a recent work [1, 2] Sjoberg remarked that generalization of the double reduction theory to partial differential equations of higher dimensions is still an open problem. In this note we have attempted to provide this generalization to…

Analysis of PDEs · Mathematics 2009-09-28 Ashfaque H. Bokhari , Ahmad Y. Dweik , F. D. Zaman , A. H. Kara , F. M. Mahomed

We prove a general finite convergence theorem for "upward-guarded" fixpoint expressions over a well-quasi-ordered set. This has immediate applications in regular model checking of well-structured systems, where a main issue is the eventual…

Symbolic Computation · Computer Science 2012-03-19 C. Baier , N. Bertrand , Ph. Schnoebelen

Cylindrical Algebraic Decomposition (CAD) has long been one of the most important algorithms within Symbolic Computation, as a tool to perform quantifier elimination in first order logic over the reals. More recently it is finding…

Symbolic Computation · Computer Science 2020-03-23 Matthew England , Russell Bradford , James H. Davenport

We investigate permutations in terms of their cycle structure and descent set. To do this, we generalize the classical bijection of Gessel and Reutenauer to deal with permutations that have some ascending and some descending blocks. We then…

Combinatorics · Mathematics 2009-09-01 Jacob Steinhardt

In this article, we show explicitly all possible weight enumerators for every irreducible cyclic code of length $n$ over a finite field $\mathbb F_q$, in the case which each prime divisor of $n$ is also a divisor of $q-1$.

Information Theory · Computer Science 2014-05-12 F. E. Brochero Martínez , C. R. Giraldo Vergara

We develop a rigidity theory for frameworks in $\mathbb{R}^3$ which have two coincident points but are otherwise generic and only infinitesimal motions which are tangential to a family of cylinders induced by the realisation are considered.…

Combinatorics · Mathematics 2016-07-08 Bill Jackson , Viktoria Kaszanitzky , Anthony Nixon

In recent years, many connections have been made between minimal codes, a classical object in coding theory, and other remarkable structures in finite geometry and combinatorics. One of the main problems related to minimal codes is to give…

Information Theory · Computer Science 2023-02-13 Martin Scotti

Let $\mathcal{L}$ and $\mathcal{L}_0$ be the binary codes generated by the column $\mathbb{F}_2$-null space of the incidence matrix of external points versus passant lines and internal points versus secant lines with respect to a conic in…

Combinatorics · Mathematics 2011-04-05 Junhua Wu

In [2] we show how to construct information sets for Reed-Muller codes only in terms of their basic parameters. In this work we deal with the corresponding problem for q-ary Generalized Reed-Muller codes of first and second order. We see…

Information Theory · Computer Science 2024-01-31 José Joaquín Bernal

Although there are many simple proofs of Jordan's decomposition theorem in the literature (see [1], the references mentioned there, and [2]), our proof seems to be even more elementary. In fact, all we need is the theorem on the dimensions…

History and Overview · Mathematics 2007-05-23 Pawel Kroeger

An elliptic divisibility sequence, generated by a point in the image of a rational isogeny, is shown to possess a uniformly bounded number of prime terms. This result applies over the rational numbers, assuming Lang's conjecture, and over…

Number Theory · Mathematics 2015-05-13 Graham Everest , Patrick Ingram , Valery Mahe , Shaun Stevens

We introduce {\em admissible collections} for a finite group $G$ and use them to prove that most of the finite classical groups in non-defining characteristic satisfy the {\em Quillen dimension at $p$ property}, a strong version of…

Group Theory · Mathematics 2020-05-07 Antonio Díaz Ramos , Nadia Mazza

We use a weight-preserving, sign-reversing involution to find a combinatorial expansion of $\Delta_{e_k} e_n$ at $q=1$ in terms of the elementary symmetric function basis. We then use a weight-preserving bijection to prove the Delta…

Combinatorics · Mathematics 2016-09-19 Marino Romero

In this short paper we propose four conjectures in synthetic geometry that generalize Erdos-Mordell Theorem, and three conjectures in number theory that generalize Fermat Numbers.

General Mathematics · Mathematics 2009-03-10 Florentin Smarandache

This paper gives a construction of group divisible designs on the binary extension fields with block sizes 3, 4, 5, 6, and 7, respectively, which is motivated from the decoding of binary quadratic residue codes. A conjecture is proposed for…

Combinatorics · Mathematics 2017-01-02 Chong-Dao Lee , Yaotsu Chang , Chia-an Liu

In this article we introduce generalized projective spaces (Definitions $[2.1, 2.5]$) and prove three main theorems in two different contexts. In the first context we prove, in main Theorem $A$, the surjectivity of the Chinese remainder…

Commutative Algebra · Mathematics 2021-03-30 C. P. Anil Kumar

Nov\'{a}k conjectured in 1974 that for any cyclic Steiner triple systems of order $v$ with $v\equiv 1\pmod{6}$, it is always possible to choose one block from each block orbit so that the chosen blocks are pairwise disjoint. We consider the…

Combinatorics · Mathematics 2021-08-03 Tao Feng , Daniel Horsley , Xiaomiao Wang

In the paper, some special linear combinations of the terms of rational cycles of generalized Collatz sequences are studied. It is proved that if the coefficients of the linear combinations satisfy some conditions then these linear…

Number Theory · Mathematics 2025-10-02 Yagub N. Aliyev