English
Related papers

Related papers: Congruences and trajectories in planar semimodular…

200 papers

Motivated by a recent paper of G. Gr\"atzer, a finite distributive lattice $D$ is said to be fully principal congruence representable if for every subset $Q$ of $D$ containing $0$, $1$, and the set $J(D)$ of nonzero join-irreducible…

Rings and Algebras · Mathematics 2017-06-13 Gábor Czédli

The aim of this paper is to study lattice properties of the sharp partial order for complex matrices having index at most 1. We investigate the down-set of a fixed matrix $B$ under this partial order via isomorphisms with two different…

Rings and Algebras · Mathematics 2024-12-30 Cecilia R. Cimadamore , Laura A. Rueda , Néstor Thome , Melina V. Verdecchia

For a finite lattice L, the congruence lattice Con L of L can be easily computed from the partially ordered set J(L) of join-irreducible elements of L and the join-dependency relation D\_L on J(L). We establish a similar version of this…

General Mathematics · Mathematics 2007-05-23 Friedrich Wehrung

We show how the theory of affine geometries over the ring ${\mathbb Z}/\langle q - 1\rangle$ can be used to understand the properties of toric and generalized toric codes over ${\mathbb F}_q$. The minimum distance of these codes is strongly…

Information Theory · Computer Science 2017-03-08 John B. Little

We prove global convergence of classical projection algorithms for feasibility problems involving union convex sets, which refer to sets expressible as the union of a finite number of closed convex sets. We present a unified strategy for…

Optimization and Control · Mathematics 2023-07-18 Jan Harold Alcantara , Ching-pei Lee

We give a new construction of $(\varphi, \hat G)$-modules using the theory of prisms developed by Bhatt and Scholze. As an application, we give a new proof about the equivalence between the category of prismatic $F$-crystals in finite…

Number Theory · Mathematics 2023-08-02 Heng Du , Tong Liu

We define equivariant semiprojectivity for C*-algebras equipped with actions of compact groups. We prove that the following examples are equivariantly semiprojective: arbitrary finite dimensional C*-algebras with arbitrary actions of…

Operator Algebras · Mathematics 2011-12-21 N. Christopher Phillips

This paper gives a description of various recent results which construct monomial ideals with a given minimal free resolution. We show that these are all instances of coordinatizing a finite atomic lattice as defined by Mapes. Subsequently,…

Commutative Algebra · Mathematics 2015-09-22 Sonja Mapes , Lindsay C. Piechnik

The classical Besicovitch projection theorem states that if a planar set $E$ with finite length is purely unrectifiable, then almost all orthogonal projections of $E$ have zero length. We prove a quantitative version of this result: if…

Classical Analysis and ODEs · Mathematics 2025-07-28 Damian Dąbrowski

Let $f$ be a normalized, ordinary newform of weight $\ge 2$. For each prime $\mathfrak{p}$ of $F=\mathbb{Q}(a_n)_{n\in \mathbb{N}}$, there is an associated $\mathfrak{p}$-adic $L$-function $\mathcal{L}_\mathfrak{p}(f)\in \Lambda \otimes…

Number Theory · Mathematics 2023-12-07 Matthew Verheul

By arithmeticity and superrigidity, a commensurability class of lattices in a higher rank Lie group is defined by a unique algebraic group over a unique number subfield of $\mathbb{R}$ or $\mathbb{C}$. We prove an adelic version of…

Group Theory · Mathematics 2021-09-22 Holger Kammeyer , Steffen Kionke

We refine and advance the study of the local structure of idempotent finite algebras started in [A.Bulatov, The Graph of a Relational Structure and Constraint Satisfaction Problems, LICS, 2004]. We introduce a graph-like structure on an…

Logic in Computer Science · Computer Science 2016-01-28 Andrei A. Bulatov

For an interval finite quiver $Q$, we introduce a class of flat representations. We classify the indecomposable projective objects in the category $\mathrm{rep}(Q)$ of pointwise finite dimensional representations. We show that an object in…

Representation Theory · Mathematics 2019-10-23 Pengjie Jiao

The collection CL(T) of nonempty convex sublattices of a lattice T ordered by bi-domination is a lattice. We say that T has the fixed point property for convex sublattices (CLFPP for short) if every order preserving map f from T to CL(T)…

Combinatorics · Mathematics 2016-11-25 Dwight Duffus , Claude Laflamme , Maurice Pouzet , Robert Woodrow

We study for bounded multiplicative functions $f$ sums of the form \begin{align*} \sum_{\substack{n\leq x \atop n\equiv a\pmod q}}f(n), \end{align*} establishing that their variance over residue classes $a \pmod q$ is small as soon as…

Number Theory · Mathematics 2023-08-24 Oleksiy Klurman , Alexander P. Mangerel , Joni Teräväinen

We study the convergence of the path integral for General Relativity with matter on a picewise linear (PL) spacetime that corresponds to a triangulation of a smooth manifold by using a path-integral measure that renders the pure gravity…

General Relativity and Quantum Cosmology · Physics 2025-01-03 Aleksandar Mikovic

We study the complexity of constraint satisfaction problems for templates $\Gamma$ that are first-order definable in $(\Bbb Z; succ)$, the integers with the successor relation. Assuming a widely believed conjecture from finite domain…

Computational Complexity · Computer Science 2016-04-27 Manuel Bodirsky , Victor Dalmau , Barnaby Martin , Antoine Mottet , Michael Pinsker

Radical binomial ideals associated with finite lattices are studied. Gr\"obner basis theory turns out to be an efficient tool in this investigation.

Commutative Algebra · Mathematics 2012-04-02 Viviana Ene , Takayuki Hibi

We give a complete description of the congruence lattices of the following finite diagram monoids: the partition monoid, the planar partition monoid, the Brauer monoid, the Jones monoid (also known as the Temperley-Lieb monoid), the Motzkin…

Group Theory · Mathematics 2018-05-21 James East , James D. Mitchell , Nik Ruskuc , Michael Torpey

We propose an interior point method (IPM) for solving semidefinite programming problems (SDPs). The standard interior point algorithms used to solve SDPs work in the space of positive semidefinite matrices. Contrary to that the proposed…

Optimization and Control · Mathematics 2023-01-18 Felix Kirschner , Etienne de Klerk
‹ Prev 1 8 9 10 Next ›