中文
相关论文

相关论文: On Pseudocyclic Association Schemes

200 篇论文

For a graph $G$ and a parameter $k$, we call a vertex $k$-enabling if it belongs both to a clique of size $k$ and to an independent set of size $k$, and we call it $k$-excluding otherwise. Motivated by issues that arise in secret sharing…

数据结构与算法 · 计算机科学 2025-09-03 Uriel Feige , Ilia Pauzner

Given a $g$-dimensional abelian variety $A$ over a finite field $\mathbf{F}_q$, the Weil conjectures imply that the normalized Frobenius eigenvalues generate a multiplicative group of rank at most $g$. The Pontryagin dual of this group is a…

The sparsity order of a (simple undirected) graph is the highest possible rank (over ${\mathbb R}$ or ${\mathbb C}$) of the extremal elements in the matrix cone that consists of positive semidefinite matrices with prescribed zeros on the…

泛函分析 · 数学 2020-02-21 S. ter Horst , E. M. Klem

In this paper, we determine the bound of the valency of Cayley graphs of Frobenius groups with respect to normal Cayley subsets which guarantees to be Ramanujan. We see that if the ratio between the orders of the Frobenius kernel and…

数论 · 数学 2018-05-23 Miki Hirano , Kohei Katata , Yoshinori Yamasaki

A Tatra association scheme is an association scheme arising from a symmetric bilinear form defined on the equivalence classes of nonzero $2$-dimensional vectors modulo some subgroup of the multiplicative group of a finite field. In the…

组合数学 · 数学 2026-05-11 Grigory Ryabov

In this paper we introduce and study the relative cyclic subgroup commutativity degrees of a finite group. We show that there is a finite group with $n$ such degrees for all $n \in \mathbb{N}^*\setminus \lbrace 2\rbrace$ and we indicate…

群论 · 数学 2018-03-21 Mihai-Silviu Lazorec

Let $S$ be a noetherian scheme, and let $E$ be a coherent sheaf on it. We define a group-valued contravariant functor $GL_E$ on $S$-schemes by associating to any $S$-scheme $T$ the group $GL_E(T)$ of all linear automorphisms of the pullback…

代数几何 · 数学 2007-05-23 Nitin Nitsure

A subset of an abelian group is {\em sequenceable} if there is an ordering $(x_1, \ldots, x_k)$ of its elements such that the partial sums $(y_0, y_1, \ldots, y_k)$, given by $y_0 = 0$ and $y_i = \sum_{j=1}^i x_i$ for $1 \leq i \leq k$, are…

组合数学 · 数学 2022-04-04 Simone Costa , Stefano Della Fiore , M. A. Ollis , Sarah Z. Rovner-Frydman

It is well known that every finite subgroup of automorphism group of polynomial algebra of rank 2 over the field of zero characteristic is conjugated with a subgroup of linear automorphisms. We prove that it is not true for an arbitrary…

群论 · 数学 2015-01-13 Valeriy G. Bardakov , Mikhail V. Neshchadim

Suppose that a Lie algebra $L$ admits a finite Frobenius group of automorphisms $FH$ with cyclic kernel $F$ and complement $H$ of order 2, such that the fixed-point subalgebra of $F$ is trivial and the fixed-point subalgebra of $H$ is…

环与代数 · 数学 2022-12-08 N. Yu. Makarenko

Pseudo-splines form a family of subdivision schemes that provide a natural blend between interpolating schemes and approximating schemes, including the Dubuc-Deslauriers schemes and B-spline schemes. Using a generating function approach, we…

数值分析 · 数学 2017-09-22 Georg Muntingh

First and second fundamental theorems are given for polynomial invariants of a class of pseudo-reflection groups (including the Weyl groups of type $B_n$), under the assumption that the order of the group is invertible in the base field.…

表示论 · 数学 2015-02-12 M. Domokos

Most elementary numerical schemes found useful for solving classical trajectory problems are {\it canonical transformations}. This fact should be make more widely known among teachers of computational physics and Hamiltonian mechanics. From…

物理教育 · 物理学 2019-12-18 Siu A. Chin

It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…

综合数学 · 数学 2007-05-23 Aleksandr Golubchik

A graph $G$ is pseudo 2-factor isomorphic if the parity of the number of cycles in a 2-factor is the same for all 2-factors of $G$. Abreu et al. conjectured that $K_{3,3}$, the Heawood graph and the Pappus graph are the only essentially…

组合数学 · 数学 2015-05-28 Jan Goedgebeur

We extend the definition of fundamental group scheme to non reduced schemes over any connected Dedekind scheme. Then we compare the fundamental group scheme of an affine scheme with that of its reduced part.

代数几何 · 数学 2012-09-19 Marco Antei

Univariate pseudo-splines are a generalization of uniform B-splines and interpolatory $2n$-point subdivision schemes. Each pseudo-spline is characterized as the subdivision scheme with least possible support among all schemes with specific…

数值分析 · 数学 2017-06-12 Costanza Conti , Chongyang Deng , Kai Hormann

A semiring scheme generalizes a scheme in such a way that the underlying algebra is that of semirings. We generalize \v{C}ech cohomology theory and invertible sheaves to semiring schemes. In particular, when $X=\mathbb{P}^n_M$, a projective…

代数几何 · 数学 2015-06-22 Jaiung Jun

Schwede proved very recently in arXiv:0901.1154 that in a quasiprojective scheme X with a fixed Frobenius splitting, there are only finitely many subschemes {Y} that are compatibly split. (A simpler proof has already since been given in…

代数几何 · 数学 2009-01-16 Allen Knutson

We construct an algebraic-cycle based model for the motivic cohomology on the category of schemes of finite type over a field, where schemes may admit arbitrary singularities and may be non-reduced. We show that our theory is functorial on…

代数几何 · 数学 2021-12-30 Jinhyun Park
‹ 上一页 1 8 9 10 下一页 ›