English
Related papers

Related papers: Algorithms for determination of t-module structure…

200 papers

We present an algorithm for computing the structure of any submodule of the module of points of a Drinfeld $A$-module over a finite field, where $A$ is a function ring over $\mathbb F_q$. When the function ring is $A = \mathbb F_q[T]$, we…

Number Theory · Mathematics 2026-02-27 Antoine Leudière , Renate Scheidler

We revisit an algorithm constructing elliptic tori, that was originally designed for applications to planetary hamiltonian systems. The scheme is adapted to properly work with models of chains of $N+1$ particles interacting via anharmonic…

Mathematical Physics · Physics 2021-02-26 Chiara Caracciolo , Ugo Locatelli

We introduce a spreading out technique to deduce finiteness results for \'etale fundamental groups of complex varieties by characteristic $p$ methods, and apply this to recover a finiteness result proven recently for local fundamental…

Algebraic Geometry · Mathematics 2017-05-23 Bhargav Bhatt , Ofer Gabber , Martin Olsson

We study the structure of the abelian category of modules for the triplet $W$-algebra $\mathcal{W}_{p_+,p_-}$. Using the logarithmic deformation by Fjelstad et al.(2002), we construct logarithmic $\mathcal{W}_{p_+,p_-}$-modules that have…

Representation Theory · Mathematics 2023-05-23 Hiromu Nakano

Reasoning about array data structures is a key requirement for many applications in hardware and software verification, especially in combination with machine integers. The Satisfiability Modulo Theories (SMT) theory of extensional arrays…

Logic in Computer Science · Computer Science 2026-05-20 Mathias Preiner , Aina Niemetz , Clark Barrett

We classify finite irreducible conformal modules over a class of infinite Lie conformal algebras ${\frak {B}}(p)$ of Block type, where $p$ is a nonzero complex number. In particular, we obtain that a finite irreducible conformal module over…

Rings and Algebras · Mathematics 2017-12-20 Yucai Su , Chunguang Xia , Lamei Yuan

Probabilistic circuits (PCs) are a unifying representation for probabilistic models that support tractable inference. Numerous applications of PCs like controllable text generation depend on the ability to efficiently multiply two circuits.…

Artificial Intelligence · Computer Science 2025-05-01 Honghua Zhang , Benjie Wang , Marcelo Arenas , Guy Van den Broeck

In this article we study support $\tau$-tilting modules, semibricks and more over blocks of group algebras. Let $k$ be an algebraically closed field of characteristic $p>0$, $\tilde{G}$ a finite group and $G$ a normal subgroup of…

Representation Theory · Mathematics 2022-09-15 Ryotaro Koshio , Yuta Kozakai

Let $R$ be an affine algebra over an algebraically closed field of characteristic $0$ with dim$(R)=n$. Let $P$ be a projective $A=R[T_1,\cdots,T_k]$-module of rank $n$ with determinant $L$. Suppose $I$ is an ideal of $A$ of height $n$ such…

Commutative Algebra · Mathematics 2022-04-18 Manoj K. Keshari , Md. Ali Zinna

Following our previous work, we develop an algorithm to compute a presentation of the fundamental group of certain partial compactifications of the complement of a complex arrangement of lines in the projective plane. It applies, in…

Algebraic Geometry · Mathematics 2021-09-09 Rodolfo Aguilar Aguilar

We consider polynomial codes for private distributed matrix multiplication (PDMM/SDMM). Existing codes for PDMM are either specialized for the outer product partitioning (OPP), or inner product partitioning (IPP), or are valid for the more…

Information Theory · Computer Science 2026-01-27 Christoph Hofmeister , Razane Tajeddine , Antonia Wachter-Zeh , Rawad Bitar

We consider integer programs whose constraint matrix has a special block structure: $\min\{f(x):H_{com}x=b, l\le x\le u,x\in\mathbb{Z}^{t_B+nt_A}\}$, where the objective function $f$ is separable convex and the constraint matrix $H_ {com}$…

Optimization and Control · Mathematics 2021-11-15 Hua Chen , Lin Chen , Guochuan Zhang

Let $R$ be a commutative ring $R$ with $1_R$ and with group of units $R^{\times}$. Let $\Phi = \Phi(t_1,\ldots, t_h) = \sum_{i=1}^h \varphi_it_i$ be an $h$-ary linear form with nonzero coefficients $\varphi_1,\ldots, \varphi_h \in R$. Let…

Number Theory · Mathematics 2021-01-06 Melvyn B. Nathanson

One of the algebraic structures that has emerged recently in the study of the operator product expansions of chiral fields in conformal field theory is that of a Lie conformal algebra [K]. A Lie pseudoalgebra is a generalization of the…

Quantum Algebra · Mathematics 2007-05-23 B. Bakalov , A. D'Andrea , V. G. Kac

A theory T is tight if different deductively closed extensions of T (in the same language) cannot be bi-interpretable. Many well-studied foundational theories are tight, including PA [Visser2006], ZF, Z2, and KM [enayat2017]. In this…

Logic · Mathematics 2023-05-16 Alfredo Roque Freire , Kameryn J. Williams

If in a given rank $r$, there is an irreducible complex local system with torsion determinant and quasi-unipotent monodromies at infinity on a smooth quasi-projective variety, then for every prime number $\ell$, there is an absolutely…

Algebraic Geometry · Mathematics 2023-02-22 Johan de Jong , Hélène Esnault

Let $A$ be a hereditary algebra over an algebraically closed field $k$ and $A^{(m)}$ be the $m$-replicated algebra of $A$. Given an $A^{(m)}$-module $T$, we denote by $\delta (T)$ the number of non isomorphic indecomposable summands of $T$.…

Representation Theory · Mathematics 2013-01-24 Shunhua Zhang

We show that if a graded submodule of a Noetherian module cannot be written as a proper intersection of graded submodules, then it cannot be written as a proper intersection of submodules at all. More generally, we show that a natural…

Commutative Algebra · Mathematics 2016-10-03 Justin Chen , Youngsu Kim

A recurring theme in finite group theory is understanding how the structure of a finite group is determined by the arithmetic properties of group invariants. There are results in the literature determining the structure of finite groups…

Group Theory · Mathematics 2025-04-04 Christopher A. Schroeder , Hung P. Tong-Viet

We present decidability results for termination of classes of term rewriting systems modulo permutative theories. Termination and innermost termination modulo permutative theories are shown to be decidable for term rewrite systems (TRS)…

Logic in Computer Science · Computer Science 2015-07-01 Luis Barguno , Guillem Godoy , Eduard Huntingford , Ashish Tiwari
‹ Prev 1 4 5 6 7 8 10 Next ›