中文
相关论文

相关论文: Neighborhood complexes and generating functions fo…

200 篇论文

Let $\Gamma$ be a group which is virtually free of rank at least 2 and let $\mathcal{F}_{td}(\Gamma)$ be the family of totally disconnected, locally compact groups containing $\Gamma$ as a co-compact lattice. We prove that the values of the…

群论 · 数学 2007-05-23 Udo Baumgartner

Let $f,g\in Z[X]$ be monic polynomials of degree $n$ and let $C,D\in M_n(Z)$ be the corresponding companion matrices. We find necessary and sufficient conditions for the subalgebra $Z< C,D>$ to be a sublattice of finite index in the full…

环与代数 · 数学 2010-08-10 Natalio H. Guersenzvaig , Fernando Szechtman

We compute generating functions for the sum of the real-valued character degrees of the finite general linear and unitary groups, through symmetric function computations. For the finite general linear group, we get a new combinatorial proof…

群论 · 数学 2013-06-04 Jason Fulman , C. Ryan Vinroot

Given an integer m>=1, let || || be a norm in R^{m+1} and let S denote the set of points with nonnegative coordinates in the unit sphere with respect to this norm. Consider for each 1<= j<= m a function f_j(z) that is analytic in an open…

组合数学 · 数学 2007-06-13 Manuel Lladser

Let $G$ be a linear semisimple Lie group without compact factors. We show that uniform approximate lattices $\Lambda$ arising as regular model sets in $G$ determine the ambient group $G$ in a strong sense. Specifically, for every…

群论 · 数学 2026-04-03 Arunava Mandal , Shashank Vikram Singh

Most practical constructions of lattice codes with high coding gains are multilevel constructions where each level corresponds to an underlying code component. Construction D, Construction D$'$, and Forney's code formula are classical…

信息论 · 计算机科学 2014-01-03 Wittawat Kositwattanarerk , Frédérique Oggier

We construct a torsion-free arithmetic lattice in $\mathrm{PGL}_2(\mathbb{F}_2(\!(t)\!))\times\mathrm{PGL}_2(\mathbb{F}_2(\!(t)\!))$ arising from a quaternion algebra over $\mathbb{F}_2(z)$. It is the fundamental group of a square complex…

群论 · 数学 2019-04-17 Nithi Rungtanapirom

Let $n$ be a positive integer. In this paper we provide a general theory to produce full orbit sequences in the affine $n$-dimensional space over a finite field. For $n=1$ our construction covers the case of the Inversive Congruential…

数论 · 数学 2019-02-13 Federico Amadio Guidi , Sofia Lindqvist , Giacomo Micheli

A lifting of a semilattice S is an algebra A such that the semilattice of compact (=finitely generated) congruences of A is isomorphic to S. The aim of this work is to give a categorical theory of partial algebras endowed with a partial…

范畴论 · 数学 2010-12-10 Pierre Gillibert

We develop a practical method for computing local zeta functions of groups, algebras, and modules in fortunate cases. Using our method, we obtain a complete classification of generic local representation zeta functions associated with…

群论 · 数学 2016-02-03 Tobias Rossmann

In this paper we describe an approach to construct large extendable collections of vectors in predefined spaces of given dimensions. These collections are useful for neural network latent space configuration and training. For classification…

代数几何 · 数学 2025-12-05 Igor V. Netay

We introduce a model-complete theory which completely axiomatizes the structure $Z_{\alpha}=(Z, +, 0, 1, f)$ where $f : x \to \lfloor{\alpha} x \rfloor $ is a unary function with $\alpha$ a fixed transcendental number. When $\alpha$ is…

逻辑 · 数学 2025-10-16 Mohsen Khani , Ali N. Valizadeh , Afshin Zarei

We consider the $U(1)$ gauge theory on a four-dimensional torus, where the instanton number is restricted to an integral multiple of $p$. This theory possesses the nontrivial higher-group structure, which can be regarded as a generalization…

高能物理 - 理论 · 物理学 2024-01-11 Naoto Kan , Okuto Morikawa , Yuta Nagoya , Hiroki Wada

Rough sets are efficient for data pre-processing in data mining. Matroids are based on linear algebra and graph theory, and have a variety of applications in many fields. Both rough sets and matroids are closely related to lattices. For a…

人工智能 · 计算机科学 2013-12-17 Qingyin Li , William Zhu

We show that the generating function $\sum_{n\ge0}M_n\,z^n$ for Motzkin numbers $M_n$, when coefficients are reduced modulo a given power of $2$, can be expressed as a polynomial in the basic series $\sum _{e\ge0} ^{} {z^{4^e}}/(…

组合数学 · 数学 2018-06-26 Christian Krattenthaler , Thomas W. Müller

In this work we consider a straightforward linear programming formulation of the recently introduced $\{k\}$-packing function problem in graphs, for each fixed value of the positive integer number $k$. We analyse a special relation between…

组合数学 · 数学 2018-12-27 Mariana Escalante , Erica Hinrichsen , Valeria. Leoni

A general method for constructing logarithmic modules in vertex operator algebra theory is presented. By utilizing this approach, we give explicit vertex operator construction of certain indecomposable and logarithmic modules for the…

量子代数 · 数学 2014-11-18 Drazen Adamovic , Antun Milas

We say a power series $\sum_{n=0}^\infty a_n q^n$ is multiplicative if the function $n\mapsto a_n/a_1$ ($n\ge 1$) is so. In this paper, we consider multiplicative power series $f$ such that $f^2$ is also multiplicative. We find various…

数论 · 数学 2019-10-30 Michael Larsen

Improving and clarifying a construction of Horowitz and Shelah, we show how to construct (in $\textsf{ZF}$, that is, without using the Axiom of Choice) maximal cofinitary groups. Among the groups we construct, one is definable by a formula…

逻辑 · 数学 2024-12-05 David Schrittesser

In this article, we consider the weighted generating function of matchings in the complete graph. We define an Artinian Gorenstein algebra as the quotient ring of a polynomial ring by the annihilator of the generating function. We show the…

交换代数 · 数学 2023-02-23 Yasuhide Numata