English
Related papers

Related papers: The asymptotic existence of BIBDs having a nesting

200 papers

We present some Zermelo-Fraenkel consistency results regarding bi-orderability of groups, as well as a construction of groups with Conradian orders whose every action on metric spaces has bounded orbits. A classical consequence of the…

Group Theory · Mathematics 2021-07-01 Samuel M. Corson

We develop the theory and algorithms necessary to be able to verify the strong Birch--Swinnerton-Dyer Conjecture for absolutely simple modular abelian varieties over $\mathbf{Q}$. We apply our methods to all 28 Atkin--Lehner quotients of…

Number Theory · Mathematics 2024-09-16 Timo Keller , Michael Stoll

Let $X$ be a $v$-set, $\B$ a set of 3-subsets (triples) of $X$, and $\B^+\cup\B^-$ a partition of $\B$ with $|\B^-|=s$. The pair $(X,\B)$ is called a simple signed Steiner triple system, denoted by ST$(v,s)$, if the number of occurrences of…

Combinatorics · Mathematics 2011-11-15 E. Ghorbani , G. B. Khosrovshahi

We introduce a method that produces a bijection between the posets ${\rm silt-}{A}$ and ${\rm silt-}{B}$ formed by the isomorphism classes of basic silting complexes over finite-dimensional $k$-algebras $A$ and $B$, by lifting $A$ and $B$…

Representation Theory · Mathematics 2021-01-20 Florian Eisele

We study a broad class of qudit stabilizer codes, termed $\mathbb{Z}_N$ bivariate-bicycle (BB) codes, arising either as two-dimensional realizations of modulated gauge theories or as $\mathbb{Z}_N$ generalizations of binary BB codes. Our…

Strongly Correlated Electrons · Physics 2026-05-08 Siyu He , Hao Song

Generalizing Reiner's notion of set partitions of type $B_n$, we define colored $B_n$-partitions by coloring the elements in and not in the zero-block respectively. Considering the generating function of colored $B_n$-partitions, we get the…

Combinatorics · Mathematics 2015-01-06 David G. L. Wang

Can an ideal I in a polynomial ring k[x] over a field be moved by a change of coordinates into a position where it is generated by binomials $x^a - cx^b$ with c in k, or by unital binomials (i.e., with c = 0 or 1)? Can a variety be moved…

Commutative Algebra · Mathematics 2017-06-13 Lukas Katthän , Mateusz Michałek , Ezra Miller

A family of $k$-subsets $A_1, A_2, ..., A_d$ on $[n]=\{1,2,..., n\}$ is called a $(d, c)$-cluster if the union $A_1\cup A_2 \cup ... \cup A_d$ contains at most $ck$ elements with $c<d$. Let $\mathcal{F}$ be a family of $k$-subsets of an…

Combinatorics · Mathematics 2009-04-24 William Y. C. Chen , Jiuqiang Liu , Larry X. W. Wang

Given a group G and positive integers k,n, we let B_n=B_n(G) denote the set of all elements x in G such that |x^G|\leq n, and we say that G satisfies the (k,n)-covering condition for commutators if there is a subset S in G such that |S|\leq…

Group Theory · Mathematics 2025-01-03 Eloisa Detomi , Marta Morigi , Pavel Shumyatsky

By a nondegenerate $k$-parameterized family $K$ of periodic solutions we understand the situation when the geometric multiplicity of the multiplier +1 of the linearized on $K$ system equals to $k.$ Bifurcation of asymptotically stable…

Classical Analysis and ODEs · Mathematics 2009-11-10 A. Buica , J. Llibre , O. Makarenkov

We introduce ($\ell$-)bimonoids as ordered algebras consisting of two compatible monoidal structures on a partially ordered (lattice-ordered) set. Bimonoids form an appropriate framework for the study of a general notion of complementation,…

Logic · Mathematics 2023-02-02 Nick Galatos , Adam Přenosil

It is shown that if $\mathfrak B(V) $ is connected Nichols algebra of diagonal type with $\dim V>1$, then $\dim (\mathfrak L^-(V)) = \infty$ $($resp. $ \dim (\mathfrak L(V)) = \infty $$)$ $($ resp. $ \dim (\mathfrak B(V)) = \infty $$)$ if…

Quantum Algebra · Mathematics 2019-03-19 Weicai Wu , Shouchuan Zhang , Yao-Zhong Zhang

The algebraic extension $\boldsymbol{B}_{\mathbb{Z}}^{\mathscr{F}}$ of the extended bicyclic semigroup for an arbitrary $\omega$-closed family $\mathscr{F}$ subsets of $\omega$ is introduced. It is proven that…

Group Theory · Mathematics 2021-11-15 Oleg Gutik , Inna Pozdnyakova

A $2-(v,k,\lambda)$ directed design (or simply a $2-(v,k,\lambda)DD$) is super-simple if its underlying $2-(v,k,2\lambda)BIBD$ is super-simple, that is, any two blocks of the $BIBD$ intersect in at most two points. A $2-(v,k,\lambda)DD$ is…

Combinatorics · Mathematics 2012-06-26 Nasrin Soltankhah , Farzane Amirzade

In [1] the authors showed some basic properties of a pre-order that arose in combinatorial number theory, namely the finite embeddability between sets of natural numbers, and they presented its generalization to ultrafilters, which is…

Logic · Mathematics 2014-06-13 Lorenzo Luperi Baglini

A ${\rm{TS}}(v,\lambda)$ is a pair $(V,\mathcal{B})$ where $V$ contains $v$ points and $\mathcal{B}$ contains $3$-element subsets of $V$ so that each pair in $V$ appears in exactly $\lambda$ blocks. A $2$-block intersection graph ($2$-BIG)…

Combinatorics · Mathematics 2019-01-10 John Asplund , Melissa Keranen

We give sufficient conditions for two Cantor sets of the line to be nested for a positive set of translation parameters. This problem occurs in diophantine approximations. It also occurs as a toy model of the parameter selection for…

Dynamical Systems · Mathematics 2013-07-29 Pierre Berger , Carlos Gustavo Moreira

Let $p$ be a prime number, $k$ an algebraically closed field of characteristic $p$, $\tilde{G}$ a finite group, and $G$ a normal subgroup of $\tilde{G}$ having a $p$-power index in $\tilde{G}$. Moreover let $B$ be a block of $kG$ with a…

Representation Theory · Mathematics 2023-01-11 Yuta Kozakai

In an influential 2008 paper, Baker proposed a number of conjectures relating the divisor theory of algebraic curves with an analogous combinatorial theory on finite graphs. In this note, we examine Baker's Brill--Noether existence…

Algebraic Geometry · Mathematics 2018-12-06 Stanislav Atanasov , Dhruv Ranganathan

Immanants are polynomial functions of n by n matrices attached to irreducible characters of the symmetric group S_n, or equivalently to Young diagrams of size n. Immanants include determinants and permanents as extreme cases. Valiant proved…

Computational Complexity · Computer Science 2007-05-23 Jean-Luc Brylinski , Ranee Brylinski
‹ Prev 1 4 5 6 7 8 10 Next ›