English
Related papers

Related papers: Assembly Addition Chains

200 papers

We introduce the Insertion Chain Complex, a higher-dimensional extension of insertion graphs, as a new framework for analyzing finite sets of words. We study its topological and combinatorial properties, in particular its homology groups,…

Combinatorics · Mathematics 2025-09-17 Nataša Jonoska , Francisco Martinez-Figueroa , Masahico Saito

We introduce a relaxation of the notion of tensor rank, called s-rank, and show that upper bounds on the s-rank of the matrix multiplication tensor imply upper bounds on the ordinary rank. In particular, if the "s-rank exponent of matrix…

Numerical Analysis · Mathematics 2013-01-01 Henry Cohn , Christopher Umans

Let $G$ be a connected undirected graph on $n$ vertices with no loops but possibly multiedges. Given an arithmetical structure $(\textbf{r}, \textbf{d})$ on $G$, we describe a construction which associates to it a graph $G'$ on $n-1$…

Combinatorics · Mathematics 2021-06-10 Christopher Keyes , Tomer Reiter

We characterize completey (give a necessary and suffcient condition using special neat embeddings)for a relation algebra to belong to the amalgamation, strong amalgamation, and superamalgamation base of the class of representable algebras.…

Logic · Mathematics 2013-04-03 Tarek Sayed Ahmed

A superpermutation is a sequence that contains every permutation of $n$ distinct symbols as a contiguous substring. For instance, a valid example for three symbols is a sequence that contains all six permutations. This paper introduces a…

Discrete Mathematics · Computer Science 2025-05-19 Dhruv Ajmera

We show that countable increasing unions preserve a large family of well-studied covering properties, which are not necessarily sigma-additive. Using this, together with infinite-combinatorial methods and simple forcing theoretic methods,…

General Topology · Mathematics 2018-04-06 Tal Orenshtein , Boaz Tsaban

Series-parallel (SP) graphs are binary edge-labeled graphs with a designated source and target vertex, built using serial and parallel composition. A set of graphs is recognizable if membership depends only on its image under a homomorphism…

Formal Languages and Automata Theory · Computer Science 2026-04-28 Marius Bozga , Radu Iosif , Florian Zuleger

We consider extension of a closure system on a finite set S as a closure system on the same set S containing the given one as a sublattice. A closure system can be represented in different ways, e.g. by an implicational base or by the set…

Discrete Mathematics · Computer Science 2020-02-19 Karima Ennaoui , Khaled Maafa , Lhouari Nourine

In this paper we characterize a mathematical model called Maximum Common Subelement (MCS) Model and prove the existence of four different metrics on such model. We generalize metrics on graphs previously proposed in the literature and…

Discrete Mathematics · Computer Science 2015-01-28 Lauro Lins , Nivan Ferreira , Juliana Freire , Claudio Silva

In this paper, we show that a map $\delta$ over a triangular ring $\mathcal{T}$ satisfying $\delta(ab+ba)=\delta(a)b+a \tau(b)+\delta(b)a+b\tau(a)$, for all $a,b\in \mathcal{T}$ and for some maps $\tau$ over $\mathcal{T}$ satisfying…

Rings and Algebras · Mathematics 2023-01-20 Sk Aziz , Arindam Ghosh , Om Prakash

We show that for any set $S\subseteq \mathbb{Z}$, $|S|=4$ there exists a 3-coloring of $\mathbb{Z}$ in which every translate of $S$ receives all three colors. This implies that $S$ has a codensity of at most $1/3$, proving a conjecture of…

We study biplane graphs drawn on a finite planar point set $S$ in general position. This is the family of geometric graphs whose vertex set is $S$ and can be decomposed into two plane graphs. We show that two maximal biplane graphs---in the…

Computational Geometry · Computer Science 2017-08-10 Alfredo García , Ferran Hurtado , Matias Korman , Inês Matos , Maria Saumell , Rodrigo I. Silveira , Javier Tejel , Csaba D. Tóth

We construct the augmentation representation. It is a representation of the fundamental group of the link complement associated to an augmentation of the framed cord algebra. This construction connects representations of two link invariants…

Geometric Topology · Mathematics 2022-08-16 Honghao Gao

Recently there has been considerable interest in studying the length and the depth of finite groups, algebraic groups and Lie groups. In this paper we introduce and study similar notions for algebras. Let $k$ be a field and let $A$ be an…

Rings and Algebras · Mathematics 2021-03-24 Damian Sercombe , Aner Shalev

Given integers d >= 1, and g >= 2, a g-addition chain for d is a sequence of integers a_0=1, a_1, a_2,..., a_{r-1}, a_r=d where a_i=a_{j_1}+a_{j_2}+...+a_{j_k}, with 2 =< k =< g, and 0 =< j_1 =< j_2 =< ... =< j_k =< i-1. The length of a…

Number Theory · Mathematics 2016-07-26 Yara Elias , Pierre McKenzie

A joint of a set of lines $\mathcal{L}$ in $\mathbb{F}^d$ is a point that is contained in $d$ lines with linearly independent directions. The joints problem asks for the maximum number of joints that are formed by $L$ lines. Guth and Katz…

Combinatorics · Mathematics 2023-12-25 Ting-Wei Chao , Hung-Hsun Hans Yu

We consider the multiplicative structure of sets of the form AA+1, where where A is a large, finite set of real numbers. In particular, we show that the additively shifted product set, AA+1 must have a large part outside of any generalized…

Combinatorics · Mathematics 2012-05-23 Steven Senger

The number theoretic analogue of a net in metric geometry suggests new problems and results in combinatorial and additive number theory. For example, for a fixed integer g > 1, the study of h-nets in the additive group of integers with…

Number Theory · Mathematics 2017-10-16 Melvyn B. Nathanson

Let A, B and S be three subsets of a finite Abelian group G. The restricted sumset of A and B with respect to S is defined as A\wedge^{S} B= {a+b: a in A, b in B and a-b not in S}. Let L_S=max_{z in G}| {(x,y): x,y in G, x+y=z and x-y in…

Number Theory · Mathematics 2013-05-14 Yahya ould Hamidoune , Susana C. Lopez , Alain Plagne

Let $p$ be an odd prime. For nontrivial proper subsets $A,B$ of $\mathbb{Z}_p$ of cardinality $s,t$, respectively, we count the number $r(A,B,B)$ of additive triples, namely elements of the form $(a, b, a+b)$ in $A \times B \times B$. For…

Combinatorics · Mathematics 2024-05-09 Sophie Huczynska , Jonathan Jedwab , Laura Johnson
‹ Prev 1 4 5 6 7 8 10 Next ›