相关论文: An Element $\phi$-$\delta$-Primary to another Elem…

We prove an elementary additive combinatorics inequality, which says that if $A$ is a subset of an Abelian group, which has, in some strong sense, large doubling, then the difference set A-A has a large subset, which has small doubling.

When the discriminants $\Delta$ and $\Delta p^2$ are idoneal, Patane proved a theorem which connects the theta series associated to binary quadratic forms of each discriminant. This paper generalizes the main theorem of Patane by no longer…

The aim of this paper is to provide a new perspective on finite element accuracy. Starting from a geometrical reading of the Bramble-Hilbert lemma, we recall the two probabilistic laws we got in previous works that estimate the relative…

In this paper, we show that \phi is a dependent formula if and only if all \phi-types have an extension to a \phi-isolated \phi-type that is an "elementary \phi-extension" (see Definition 2.3 in the paper). Moreover, we show that the domain…

For a given complete lattice L, we investigate whether L can be decomposed as a direct product of directly indecomposable lattices. We prove that this is the case if every element of L is a join of join-irreducible elements and dually, thus…

Let $L$ be a distributive lattice and $R(L)$ the associated Hibi ring. We compute $\reg R(L)$ when $L$ is a planar lattice and give a lower bound for $\reg R(L)$ when $L$ is non-planar, in terms of the combinatorial data of $L.$ As a…

We prove that every lattice with more than one element has a proper congruence-preserving extension.

Let $q$ be a prime power and $n, r$ integers such that $r\mid q^n-1$. An element of $\mathbb{F}_{q^n}$ of multiplicative order $(q^n-1)/r$ is called \emph{$r$-primitive}. For any odd prime power $q$, we show that there exists a…

Let $A$ be a finite dimensional algebra of finite global dimension over a finite field. In the present paper, we introduce certain elements in Bridgeland's Hall algebra of $A$, and give a multiplication theorem of these elements. In…

We completely determine upper-modular, codistributive and costandard elements in the lattice of all commutative semigroup varieties. In particular, we prove that the properties of being upper-modular and codistributive elements in the…

A mixed lattice is a lattice-type structure consisting of a set with two partial orderings, and generalizing the notion of a lattice. Mixed lattice theory has previously been studied in various algebraic structures, such as groups and…

We describe a deterministic algorithm for finding a generating element of the multiplicative group of the finite field $\mathbb{F}_{p^n}$ where $p$ is a prime. In time polynomial in $p$ and $n$, the algorithm either outputs an element that…

A lattice $L$ is said lowly finite if the set $[\mathsf{0},a]$ is finite for every element $a$ of $L$. We mainly aim to provide a complete proof that, if $M$ is a subset of a complete lowly finite distributive lattice $L$ containing its…

Proofs are traditionally syntactic, inductively generated objects. This paper reformulates first-order logic (predicate calculus) with proofs which are graph-theoretic rather than syntactic. It defines a combinatorial proof of a formula…

Fix $t\in [1,\infty]$. Let $S$ be an atomic commutative semigroup and, for all $x\in S$, let $\mathscr{L}_t(S):=\{\|f\|_t:f\in Z(x)\}$ be the "$t$-length set" of $x$ (using the standard $l_p$-space definition of $\|\cdot\|_t$). The…

We start a systematic analysis of the first-order model theory of free lattices. Firstly, we prove that the free lattices of finite rank are not positively indistinguishable, as there is a positive $\exists \forall$-sentence true in…

In this paper we create a model of particle motion on a three-dimensional lattice using discrete random walk with small steps. We rigorously construct a probability space of the particle trajectories. Unlike deterministic approach in…

A factorization of a permutation into transpositions is called "primitive" if its factors are weakly ordered. We discuss the problem of enumerating primitive factorizations of permutations, and its place in the hierarchy of previously…

The groups of similarity and coincidence rotations of an arbitrary lattice L in d-dimensional Euclidean space are considered. It is shown that the group of similarity rotations contains the coincidence rotations as a normal subgroup.…

A lattice-ordered group (an $\ell$-group) $G(\oplus, \vee, \wedge)$ can be naturally viewed as a semiring $G(\vee,\oplus)$. We give a full classification of (abelian) $\ell$-groups which are finitely generated as semirings, by first showing…