中文
相关论文

相关论文: Lifting of divisible designs

200 篇论文

Let $\ell_1,\ell_2,\dots$ be a countable collection of lines in ${\mathbb R}^d$. For any $t \in [0,1]$ we construct a compact set $\Gamma\subset{\mathbb R}^d$ with Hausdorff dimension $d-1+t$ which projects injectively into each $\ell_i$,…

度量几何 · 数学 2021-08-25 Frank Coen , Nate Gillman , Tamás Keleti , Dylan King , Jennifer Zhu

We give some new explicit examples of putatively optimal projective spherical designs. i.e., ones for which there is numerical evidence that they are of minimal size. These form continuous families, and so have little apparent symmetry in…

组合数学 · 数学 2025-03-20 Alex Elzenaar , Shayne Waldron

From descent theory to higher geometry, the idea of gluing has been embedded in many elegant and powerful techniques, proving instrumental for the solution of many problems. In this paper, we introduce a framework that allows to link…

范畴论 · 数学 2026-02-25 Rita Fioresi , Angelica Simonetti , Ferdinando Zanchetta

We prove that for any partition of a set which contains an infinite arithmetic (respectively geometric) progression into two disjoint subsets, at least one of these subsets contains an infinite number of triplets such that each triplet is…

综合数学 · 数学 2009-11-24 Florentin Smarandache

Almost designs ($t$-adesigns) were proposed and discussed by Ding as a certain generalization of combinatorial designs related to almost difference sets. Unlike $t$-designs, it is not clear whether $t$-adesigns need also be $(t-1)$-designs…

组合数学 · 数学 2018-11-19 Jerod Michel , Qi Wang

We construct some irreducible representations of the Leavitt path algebra of an arbitrary quiver. The constructed representations are associated to certain algebraic branching systems. For a row-finite quiver, we classify algebraic…

表示论 · 数学 2015-02-10 Xiao-Wu Chen

High dimensional expanders (HDXs) are a hypergraph generalization of expander graphs. They are extensively studied in the math and TCS communities due to their many applications. Like expander graphs, HDXs are especially interesting for…

离散数学 · 计算机科学 2024-07-16 Inbar Ben Yaacov , Yotam Dikstein , Gal Maor

A $t\text{-}(n,K,\lambda;q)$ design, also called the $q$-analog of a $t$-wise balanced design, is a set ${\mathcal B}$ of subspaces with dimensions contained in $K$ of the $n$-dimensional vector space ${\mathbb F}_q^n$ over the finite field…

组合数学 · 数学 2013-08-09 Michael Braun

We prove a lifting theorem for odd Frattini covers of finite groups. Using this, we characterize solvable groups and more generally p-solvable groups in terms of containing a triple of elements of distinct prime power orders with product 1.…

群论 · 数学 2011-12-21 Robert Guralnick , Pham Huu Tiep

A group divisible design $\mbox{GDD}(m,n;\lambda_1,\lambda_2)$, is an ordered pair $(V, \cal{B})$ where $V$ is an $(m+n)$-set of symbols while $\cal{B}$ is a collection of $3$-subsets (called blocks) of $V$ satisfying the following…

组合数学 · 数学 2018-02-27 Chariya Uiyyasathian , Nataphan Kitisin

A method is developed here for building differentiable three-dimensional manifolds on multicube structures. This method constructs a sequence of reference metrics that determine differentiable structures on the cubic regions that serve as…

数值分析 · 数学 2022-04-13 Lee Lindblom , Oliver Rinne , Nicholas W. Taylor

Isotopic liftings of algebraic structures are investigated in the context of Clifford algebras, where it is defined a new product involving an arbitrary, but fixed, element of the Clifford algebra. This element acts as the unit with respect…

数学物理 · 物理学 2008-11-26 Roldao da Rocha , Jayme Vaz

Special functions, coding theory and $t$-designs have close connections and interesting interplay. A standard approach to constructing $t$-designs is the use of linear codes with certain regularity. The Assmus-Mattson Theorem and the…

信息论 · 计算机科学 2019-07-31 Chunming Tang , Cunsheng Ding , Maosheng Xiong

A method to construct trihamiltonian extensions of a separable system is presented. The procedure is tested for systems, with a natural Hamiltonian, separable in classical sense in one of the four orthogonal separable coordinate systems of…

可精确求解与可积系统 · 物理学 2007-05-23 Luca Degiovanni

A classical method of constructing a linear code over $\gf(q)$ with a $t$-design is to use the incidence matrix of the $t$-design as a generator matrix over $\gf(q)$ of the code. This approach has been extensively investigated in the…

信息论 · 计算机科学 2015-03-24 Cunsheng Ding

A new methodological approach for the study of topology for shapes made of arrangements of lines, planes or solids is presented. Topologies for shapes are traditionally built on the classical theory of point-sets. In this paper, topologies…

一般拓扑 · 数学 2022-01-28 Alexandros Haridis

We propose an abelian categorification of $\hat{Z}$-invariants for Seifert $3$-manifolds. First, we give a recursive combinatorial derivation of these $\hat{Z}$-invariants using graphs with certain hypercubic structures. Next, we consider…

表示论 · 数学 2025-01-23 Shoma Sugimoto

We obtain algorithmically effective versions of the dense lattice sphere packings constructed from orders in $\mathbb{Q}$-division rings by the first author. The lattices in question are lifts of suitable codes from prime characteristic to…

数论 · 数学 2022-04-12 Nihar Gargava , Vlad Serban

In these notes we aim at bringing together design theory and projective geometry over a ring. Both disciplines are well established, but the results on the interaction between them seem to be rare and scattered over the literature. Thus our…

组合数学 · 数学 2024-02-13 Hans Havlicek

In this article we construct many examples of properly convex irreducible domains divided by Zariski dense relatively hyperbolic groups in every dimension at least 3. This answers a question of Benoist. Relative hyperbolicity and non-strict…

几何拓扑 · 数学 2025-07-16 Pierre-Louis Blayac , Gabriele Viaggi